Module traitgraph::algo [−][src]
Abstract graph algorithms.
Modules
components | Algorithms related to graph components, i.e. finding the strongly or weakly connected components of a graph or checking if a graph is strongly connected. |
dijkstra | Dijkstra’s shortest path algorithm. |
eulerian | Algorithms related to Eulerian graphs. |
predefined_graphs | Algorithms to create certain parameterisable graph classes, like binary trees. |
queue | A trait for bidirected queues to abstract over the different implementations in the standard library. |
traversal | Algorithms for graph traversals, i.e. preorder breadth or depth first search as well as postorder depth first search. |