ó ś£Õ\c@sndZdjdgƒZddddgZddlZdd lmZd „Zd „Z d „Z d „Z dS(sp ==================== Breadth-first search ==================== Basic algorithms for breadth-first searching. s sAric Hagberg t bfs_edgestbfs_treetbfs_predecessorstbfs_successorsi’’’’N(t defaultdictccs¾t|gƒ}|t||ƒfg}x|r¹|d\}}yTt|ƒ}||kr”||fV|j|ƒ|j|t||ƒfƒnWq+tk rµ|jdƒq+Xq+WdS(s;Produce edges in a breadth-first-search starting at source.iN(tsettitertnexttaddtappendt StopIterationtpop(tGtsourcetvisitedtstacktparenttchildrentchild((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pyRs     $ cCstjt||ƒƒS(s9Return directed tree of breadth-first-search from source.(tnxtDiGraphR(R R ((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pyR"scCstd„t||ƒDƒƒS(sFReturn dictionary of predecessors in breadth-first-search from source.css!|]\}}||fVqdS(N((t.0tstt((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pys )s(tdictR(R R ((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pyR'scCsGttƒ}x.t||ƒD]\}}||j|ƒqWt|ƒS(sDReturn dictionary of successors in breadth-first-search from source.(RtlistRR R(R R tdRR((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pyR,s ( t__doc__tjoint __author__t__all__tnetworkxRt collectionsRRRRR(((sj/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/traversal/breadth_first_search.pyts