Open Arc676 opened 6 years ago
I'm not familiar with this algorithm. How does it differ from the existing implementation of Dijkstra's algorithm?
It basically calculates the shortest path to all the vertices and returns them while finding the shortest path to the Node* end specified. Just a slightly modified version of your Dijkstra. What are you planning to do with this library though? I'm thinking I could use it for dependency checking for my package manager.
The library is just for representing graphs digitally and for encapsulating some path finding algorithms. It's also the backend for the GraphBuilder app.
Hello Ale, Would you like some help on adding a Dijkstra's single source shortest path algorithm?