Document

dfs_labeled_edges(G, source=None, depth_limit=None)

Notes

If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched.

The implementation of this function is adapted from David Eppstein's depth-first search function in :None:None:`PADS`, with modifications to allow depth limits based on the Wikipedia article ":None:None:`Depth-limited search`".

            <Unimplemented 'target' '.. _PADS: http://www.ics.uci.edu/~eppstein/PADS'>

            <Unimplemented 'target' '.. _Depth-limited search: https://en.wikipedia.org/wiki/Depth-limited_search'>

Parameters

G : NetworkX graph
source : node, optional: Specify starting node for depth-first search and return edges in the component reachable from source.
depth_limit : int, optional (default=len(G)): Specify the maximum search depth.

Returns

edges: generator: A generator of triples of the form (u, v, d), where (u, v) is the edge being explored in the depth-first search and d is one of the strings 'forward', 'nontree', or 'reverse'. A 'forward' edge is one in which u has been visited but v has not. A 'nontree' edge is one in which both u and v have been visited but the edge is not in the DFS tree. A 'reverse' edge is on in which both u and v have been visited and the edge is in the DFS tree.

Iterate over edges in a depth-first-search (DFS) labeled by type.

Examples

>>> from pprint import pprint
>>>
>>> G = nx.DiGraph([(0, 1), (1, 2), (2, 1)])
>>> pprint(list(nx.dfs_labeled_edges(G, source=0)))
[(0, 0, 'forward'),
 (0, 1, 'forward'),
 (1, 2, 'forward'),
 (2, 1, 'nontree'),
 (1, 2, 'reverse'),
 (0, 1, 'reverse'),
 (0, 0, 'reverse')]

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.traversal.depth_first_search.dfs_edges networkx.algorithms.traversal.depth_first_search.dfs_tree networkx.algorithms.traversal.depth_first_search.dfs_successors networkx.algorithms.traversal.depth_first_search.dfs_predecessors networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them