ó |£*^c@szdZddlZddlmZmZdjdgƒZdddd gZe d „Z e d „Z d „Z d „Z dS(s„ ==================== Breadth-first search ==================== Basic algorithms for breadth-first searching the nodes of a graph. iÿÿÿÿN(t defaultdicttdeques s%Aric Hagberg t bfs_edgestbfs_treetbfs_predecessorstbfs_successorsc csæ|r$t|tjƒr$|j}n |j}t|gƒ}t|||ƒfgƒ}xˆ|rá|d\}}yPt|ƒ}||kr¿||fV|j|ƒ|j |||ƒfƒnWqZt k rÝ|j ƒqZXqZWdS(s¾Produce edges in a breadth-first-search starting at source. Parameters ---------- G : NetworkX graph source : node Specify starting node for breadth-first search and return edges in the component reachable from source. reverse : bool, optional If True traverse a directed graph in the reverse direction Returns ------- edges: generator A generator of edges in the breadth-first-search. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(list(nx.bfs_edges(G,0))) [(0, 1), (1, 2)] Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.py by D. Eppstein, July 2004. iN( t isinstancetnxtDiGraphtpredecessors_itertneighbors_itertsetRtnexttaddtappendt StopIterationtpopleft( tGtsourcetreverset neighborstvisitedtqueuetparenttchildrentchild((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pyR s         cCs9tjƒ}|j|ƒ|jt||d|ƒƒ|S(s¿Return an oriented tree constructed from of a breadth-first-search starting at source. Parameters ---------- G : NetworkX graph source : node Specify starting node for breadth-first search and return edges in the component reachable from source. reverse : bool, optional If True traverse a directed graph in the reverse direction Returns ------- T: NetworkX DiGraph An oriented tree Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(list(nx.bfs_edges(G,0))) [(0, 1), (1, 2)] Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.py by D. Eppstein, July 2004. R(RRtadd_nodetadd_edges_fromR(RRRtT((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pyR=s  cCstd„t||ƒDƒƒS(soReturn dictionary of predecessors in breadth-first-search from source. Parameters ---------- G : NetworkX graph source : node Specify starting node for breadth-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.bfs_predecessors(G,0)) {1: 0, 2: 1} Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.py by D. Eppstein, July 2004. css!|]\}}||fVqdS(N((t.0tstt((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pys ~s(tdictR(RR((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pyRbscCsGttƒ}x.t||ƒD]\}}||j|ƒqWt|ƒS(suReturn dictionary of successors in breadth-first-search from source. Parameters ---------- G : NetworkX graph source : node Specify starting node for breadth-first search and return edges in the component reachable from source. Returns ------- succ: dict A dictionary with nodes as keys and list of succssors nodes as values. Examples -------- >>> G = nx.Graph() >>> G.add_path([0,1,2]) >>> print(nx.bfs_successors(G,0)) {0: [1], 1: [2]} Notes ----- Based on http://www.ics.uci.edu/~eppstein/PADS/BFS.py by D. Eppstein, July 2004. (RtlistRRR (RRtdRR((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pyR€s (t__doc__tnetworkxRt collectionsRRtjoint __author__t__all__tFalseRRRR(((s†/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/traversal/breadth_first_search.pyts  0 %