graph = nx.path_graph(5, nx.DiGraph)
list(nx.dfs_labeled_edges(graph, source=0))
[(0, 0, 'forward'),
(0, 1, 'forward'),
(1, 2, 'forward'),
(2, 3, 'forward'),
(3, 4, 'forward'),
(3, 4, 'reverse'),
(2, 3, 'reverse'),
(1, 2, 'reverse'),
(0, 1, 'reverse'),
(0, 0, 'reverse')]
list(nx.dfs_labeled_edges(graph, source=0, depth_limit=4))
[(0, 0, 'forward'),
(0, 1, 'forward'),
(1, 2, 'forward'),
(2, 3, 'forward'),
(3, 4, 'forward'),
(2, 3, 'reverse'),
(1, 2, 'reverse'),
(0, 1, 'reverse'),
(0, 0, 'reverse')]
graph = nx.path_graph(5, nx.DiGraph)
list(nx.dfs_labeled_edges(graph, source=0, depth_limit=4))
[(0, 0, 'forward'),
(0, 1, 'forward'),
(1, 2, 'forward'),
(2, 3, 'forward'),
(3, 4, 'forward'),
(3, 4, 'reverse'),
(2, 3, 'reverse'),
(1, 2, 'reverse'),
(0, 1, 'reverse'),
(0, 0, 'reverse')]
nx.dfs_labeled_edgesdoes not return last (deepest) visited edge when traversing backwards if depth_limit is specified.Current Behavior
Note that edge
(3, 4, 'reverse')is missing.Expected Behavior
Environment
Python version: 3.10
NetworkX version: 2.8.8 and 3.0rc1