Module petgraph::visit

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	An edge reference
GetAdjacencyMatrix	Create or access the adjacency matrix of a graph
GraphBase	Base graph trait
GraphEdgeRef	A graph that defines edge references
GraphRef	A copyable reference to a graph.
IntoEdgeReferences	Access to the sequence of the graph’s edges
IntoExternals	Access to the graph’s nodes without edges to them (Incoming) or from them (Outgoing).
IntoNeighbors	Access to the neighbors of each node
IntoNeighborsDirected	Access to the neighbors of each node, through incoming or outgoing edges.
IntoNodeIdentifiers	Access to the sequence of the graph’s NodeIds.
NodeCompactIndexable	The graph’s NodeIds map to indices, in a range without holes.
NodeIndexable	The graph’s NodeIds map to indices
VisitMap	A mapping for storing the visited status for NodeId N.
Visitable	A graph that can create a visitor map.