David Gleich

In response to Feixiong, when any of the shortest_path algorithms have a target set, the search stops when it first finds the vertex. This does not guarantee that the shortest path is correct, but it's the first path found to the vertex. In light of your comment, I plan to revisit this behavior in a future version. If you require the actual shortest paths, then you should not use the target option in MatlabBGL 4. I'm not planning to provide a patch for this until a new version is released unless I hear from others that it's a source of considerable pain. Please contact me if you need a temporary (patched) shortest_path.m file that would transparently (but potentially inefficiently) address the issue.

Thanks for the comments. I've intended to update this code for more recent versions of Matlab for a while, but somehow never find the time.

Excellent toolbox! Really appreciate it.

Question: After I've solved an all_shortest_paths problem is there a way to add another small set of vertices and add to the previous solution or do I have to solve the entire set from scrath?