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. |
| BfsIter |
An iterator for a breadth first traversal of a graph. |
| Dfs |
A depth first search (DFS) of a graph. |
| DfsIter |
An iterator for a depth first traversal of a graph. |
| Reversed |
Wrapper type for walking the graph as if all edges are reversed. |
| SubTopo |
A topological order traversal for a subgraph. |
| Topo |
A topological order traversal for a graph. |
Traits
| EdgeRef | |
| GetAdjacencyMatrix |
Create or access the adjacency matrix of a graph |
| GraphBase |
Base graph trait |
| GraphEdgeRef | |
| GraphRef |
A copyable reference to a graph. |
| IntoEdgeReferences | |
| IntoExternals | |
| IntoNeighbors | |
| IntoNeighborsDirected | |
| IntoNodeIdentifiers | |
| NodeCompactIndexable | |
| NodeIndexable | |
| VisitMap |
A mapping for storing the visited status for NodeId |
| Visitable |
A graph that can create a visitor map. |