ó |Ł*^c@s¤dZddlZddlmZdjdgƒZdddd d d d gZdd „Z d„Z dd„Z dd„Z dd„Z dd„Zdd„ZdS(sÎ ================== Depth-first search ================== Basic algorithms for depth-first searching the nodes of a graph. Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. i˙˙˙˙N(t defaultdicts s%Aric Hagberg t dfs_edgestdfs_treetdfs_predecessorstdfs_successorstdfs_preorder_nodestdfs_postorder_nodestdfs_labeled_edgesc cs|dkr|}n |g}tƒ}xŐ|D]Í}||krFq.n|j|ƒ|t||ƒfg}xŒ|rú|d\}}yTt|ƒ}||krŘ||fV|j|ƒ|j|t||ƒfƒnWqotk rö|jƒqoXqoWq.WdS(sŢProduce edges in a depth-first-search (DFS). Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- edges: generator A generator of edges in the depth-first-search. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(list(nx.dfs_edges(G,0))) [(0, 1), (1, 2)] Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. i˙˙˙˙N(tNonetsettaddtitertnexttappendt StopIterationtpop( tGtsourcetnodestvisitedtstarttstacktparenttchildrentchild((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRs&            $ cCsOtjƒ}|dkr(|j|ƒn |j|ƒ|jt||ƒƒ|S(sˇReturn oriented tree constructed from a depth-first-search from source. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search. Returns ------- T : NetworkX DiGraph An oriented tree Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> T = nx.dfs_tree(G,0) >>> print(T.edges()) [(0, 1), (1, 2)] N(tnxtDiGraphRtadd_nodes_fromtadd_nodetadd_edges_fromR(RRtT((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRIs    cCs td„t|d|ƒDƒƒS(sţReturn dictionary of predecessors in depth-first-search from source. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- pred: dict A dictionary with nodes as keys and predecessor nodes as values. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(nx.dfs_predecessors(G,0)) {1: 0, 2: 1} Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. css!|]\}}||fVqdS(N((t.0tstt((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pys ‡sR(tdictR(RR((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRhscCsJttƒ}x1t|d|ƒD]\}}||j|ƒqWt|ƒS(sReturn dictionary of successors in depth-first-search from source. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- succ: dict A dictionary with nodes as keys and list of successor nodes as values. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(nx.dfs_successors(G,0)) {0: [1], 1: [2]} Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. R(RtlistRR R"(RRtdR R!((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRŠs cCs#d„tj|d|ƒDƒ}|S(sProduce nodes in a depth-first-search post-ordering starting from source. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- nodes: generator A generator of nodes in a depth-first-search post-ordering. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(list(nx.dfs_postorder_nodes(G,0))) [2, 1, 0] Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. css.|]$\}}}|ddkr|VqdS(tdirtreverseN((RtutvR$((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pys Ďs R(RR(RRtpost((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRŻs cCs#d„tj|d|ƒDƒ}|S(s Produce nodes in a depth-first-search pre-ordering starting from source. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- nodes: generator A generator of nodes in a depth-first-search pre-ordering. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(list(nx.dfs_preorder_nodes(G,0))) [0, 1, 2] Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. css.|]$\}}}|ddkr|VqdS(R%tforwardN((RR'R(R$((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pys ös R(RR(RRtpre((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRÖs c csr|dkr|}n |g}tƒ}xD|D]<}||krFq.n||idd6fV|j|ƒ|t||ƒfg}xŃ|rT|d\}}yst|ƒ}||krÍ||idd6fVn?||idd6fV|j|ƒ|j|t||ƒfƒWq„tk rP|jƒ|rQ|dd|idd6fVqQq„Xq„W||idd6fVq.WdS(sProduce edges in a depth-first-search (DFS) labeled by type. Parameters ---------- G : NetworkX graph source : node, optional Specify starting node for depth-first search and return edges in the component reachable from source. Returns ------- edges: generator A generator of edges in the depth-first-search labeled with 'forward', 'nontree', and 'reverse'. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> edges = (list(nx.dfs_labeled_edges(G,0))) Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/DFS.py by D. Eppstein, July 2004. If a source is not specified then a source is chosen arbitrarily and repeatedly until all components in the graph are searched. R*R%i˙˙˙˙tnontreeiR&N(RR R R R R RR( RRRRRRRRR((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyRýs0!           !  ((t__doc__tnetworkxRt collectionsRtjoint __author__t__all__RRRRRRRR(((s„/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/depth_first_search.pyt s   6  " % ' '