Module daggy::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

Externals	Externals returns an iterator of all nodes that either have either no incoming or no outgoing edges.
GetAdjacencyMatrix	Create or access the adjacency matrix of a graph
Graphlike	Base trait for graphs that defines the node identifier.
NeighborIter	NeighborIter gives access to the neighbors iterator.
NeighborsDirected	NeighborsDirected gives access to neighbors of both Incoming and Outgoing edges of a node.
Revisitable	A graph that can reset and resize its visitor map.
VisitMap	A mapping for storing the visited status for NodeId N.
Visitable	A graph that can create a visitor map.