Module traitgraph::algo [−][src]
Expand description
Abstract graph algorithms.
Modules
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’s shortest path algorithm.
Algorithms related to Eulerian graphs.
Algorithms to create certain parameterisable graph classes, like binary trees.
A trait for bidirected queues to abstract over the different implementations in the standard library.
Algorithms for graph traversals, i.e. preorder breadth or depth first search as well as postorder depth first search.