Graphlib needs to compete with the BGL, so the Bellman-Ford Algorithm is one of the next logical steps along with A* and undirected graphs. Bellman-Ford allows for graphs that have negative weights which is very important.
Graphlib needs to compete with the BGL, so the Bellman-Ford Algorithm is one of the next logical steps along with A* and undirected graphs.
Bellman-Ford allows for graphs that have negative weights which is very important.