started heap, needs finishing.

FilWisher / go-algorithms

implementations of common algorithms and data structures

MIT License

2 stars 0 forks source link

Open FilWisher opened 8 years ago

FilWisher commented 8 years ago

@rjmk

rjmk commented 8 years ago

In terms of operations on the heap, you have those covered in the comment I think
Related algorithms could be minimum spanning trees

FilWisher commented 8 years ago

... could be minimum spanning trees

We should probably keep minimum spanning trees in a separate file though.

We should use the heap in a heap sort.