Module petgraph::visit
[−]
[src]
Graph visitor algorithms.
Structs
| AsUndirected |
Wrapper type for walking the graph as if it is undirected |
| Bfs |
A breadth first search (BFS) of a graph. |
| Dfs |
A depth first search (DFS) of a graph. |
| Reversed |
Wrapper type for walking edges the other way |
Traits
| GetAdjacencyMatrix |
Create or access the adjacency matrix of a graph |
| Graphlike |
Base trait for graphs that defines the node identifier. |
| NeighborIter |
A graph trait for accessing the neighbors iterator |
| VisitMap | |
| Visitable |
Trait for GraphMap that knows which datastructure is the best for its visitor map |