Closed leetal closed 8 years ago
Absolutely!
Just saw this, wanted to drop a note that I'm currently working on this at #112!
Thanks for the suggestion @leetal! I'm going to close this issue because we have a related pull request. Please feel free to raise any additional issues/suggestions for improvement!
I think a weighted variant of the shortest path algorithm would fit this great repository as well. Perhaps implementing Dijkstras or Bellman-Fords (allowing negative vertices) would yield usability for people trying to learn algorithms and also want a way of calculating the shortest, most cheap path from a given node to all others.
Just a thought 👍