Traversal

Beam search

Basic algorithms for breadth-first searching the nodes of a graph.

bfs_beam_edges(G, source, value[, width]) Iterates over edges in a beam search.

Depth First Search on Edges

Depth First Search on Edges

Algorithms for a depth-first traversal of edges in a graph.

edge_dfs(G[, source, orientation]) A directed, depth-first-search of edges in G, beginning at source.

Depth First Search on Edges

Breadth First Search on Edges

Algorithms for a depth-first traversal of edges in a graph.

edge_bfs(G[, source, orientation]) A directed, breadth-first-search of edges in G, beginning at source.