MatlabBGL provides robust and efficient graph algorithms for Matlab using native data structures.
Author: David Gleich
Hello David Gleich,
I found some error on the shortest path algorithm. in the "dijkstra_sp" function, if I specify the source only, it can find the right shortest path to all other nodes. However, when I specify both the source and target, sometime it output the right results, sometimes not. Can you sovle it?
By the way, it is very easy to extend the shortest path to bidirectional shortest path?
After all, the algorithm I am using is really efficient. Thanks.