wygos
wygos
The main issue is to make dijkstra_shortest_paths_no_init support more efficient. This is done by pruning the vertices, that are never going to be improved. Example: Assume my graph is as...
Hi, I'm happy to hear that your working on it! It is still relevant. In some special cases, the algorithm is inefficient. There was a discussion in the boost mailing...
> @wygos Can you rebase your PR on devel? DONE. Note that github shows incorrect diffs but after fetching changes everything is OK.