algorithms

algorithms copied to clipboard

shreyasingh28

Hi, I add a variable 'left' > h.Left = h.Left.Left' > h.Right = h.Left.Right This statement will cause the right node of left to be lost check it please, thanks

majianyu

heap siftUp is wrong

1

should be `(i-1) >> 1` https://github.com/arnauddri/algorithms/blob/master/data-structures/heap/heap.go#L81

Rui-L

Remove unused code

techmexdev

#2 Providing a simple Treap implementation.

DarioBalinzo

fanpei91

line 150: result := MakeMatrix(make([]float64, A.cols*A.rows), A.cols, A.rows) maybe change to: result := MakeMatrix(make([]float64, A.cols*A.rows), A.rows, .cols) the order of the params in not right ??? :)

halokid

} func (A *Matrix) add(B *Matrix) error { - if A.cols != B.cols && A.rows != B.rows { - if A.cols != B.cols || A.rows != B.rows { return errors.New("Wrong...

halokid

I want to see how Treap is implemented in Go.

kitgary

Yen's K-Shortest Path

1

Hello I would be thankful a lot if you could add Yen's KSP to the Graphs algorithms. In general, it uses Dijkstra to find k-shortest paths and is crucial, when...

AlexRevin