ó |£*^c@sòddlmZmZddlmZddlZddlmZdj dddd gƒZ d d gZ dd „Z dd „Zdd„Zedƒdd„ƒZdefd„ƒYZdddd„Zddd„Zdddd„ZdS(iÿÿÿÿ(theappushtheappop(tcountN(tnot_implemented_fors s+Sérgio Nery Simões s%Aric Hagberg sAndrey Paramonovs$Jordi Torrents tall_simple_pathstshortest_simple_pathscCsŸ||kr"tjd|ƒ‚n||krDtjd|ƒ‚n|dkrct|ƒd}n|jƒr…t|||d|ƒSt|||d|ƒSdS(s·Generate all simple paths in the graph G from source to target. A simple path is a path with no repeated nodes. Parameters ---------- G : NetworkX graph source : node Starting node for path target : node Ending node for path cutoff : integer, optional Depth to stop the search. Only paths of length <= cutoff are returned. Returns ------- path_generator: generator A generator that produces lists of simple paths. If there are no paths between the source and target within the given cutoff the generator produces no output. Examples -------- >>> G = nx.complete_graph(4) >>> for path in nx.all_simple_paths(G, source=0, target=3): ... print(path) ... [0, 1, 2, 3] [0, 1, 3] [0, 2, 1, 3] [0, 2, 3] [0, 3] >>> paths = nx.all_simple_paths(G, source=0, target=3, cutoff=2) >>> print(list(paths)) [[0, 1, 3], [0, 2, 3], [0, 3]] Notes ----- This algorithm uses a modified depth-first search to generate the paths [1]_. A single path can be found in `O(V+E)` time but the number of simple paths in a graph can be very large, e.g. `O(n!)` in the complete graph of order n. References ---------- .. [1] R. Sedgewick, "Algorithms in C, Part 5: Graph Algorithms", Addison Wesley Professional, 3rd ed., 2001. See Also -------- all_shortest_paths, shortest_path ssource node %s not in graphstarget node %s not in graphitcutoffN(tnxt NetworkXErrortNonetlent is_multigrapht_all_simple_paths_multigrapht_all_simple_paths_graph(tGtsourcettargetR((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyRs8    ccs|dkrdS|g}t||ƒg}xä|r|d}t|dƒ}|dkrq|jƒ|jƒq/t|ƒ|krÔ||krž||gVq||kr|j|ƒ|jt||ƒƒqq/||ksì||krû||gVn|jƒ|jƒq/WdS(Niiÿÿÿÿ(titertnextR tpopR tappend(RRRRtvisitedtstacktchildrentchild((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR [s(           c csA|dkrdS|g}d„|j|ƒDƒg}x|r<|d}t|dƒ}|dkrz|jƒ|jƒq8t|ƒ|kræ||kr§||gVq9||kr9|j|ƒ|jd„|j|ƒDƒƒq9q8|gt|ƒj|ƒ}x t|ƒD]} ||gVqW|jƒ|jƒq8WdS(Nicss|]\}}|VqdS(N((t.0tutv((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pys wsiÿÿÿÿcss|]\}}|VqdS(N((RRR((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pys ƒs( tedgesRR RR RtlistRtrange( RRRRRRRRRti((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR ss*          & t multigraphc #s |ˆkr"tjd|ƒ‚n|ˆkrDtjd|ƒ‚nˆd kr_t}t}n‡‡fd†}t}tƒ}tƒ}d }xvtr|sÏ|ˆ||dˆƒ\} } |j | | ƒnt ƒ} t ƒ} xòt dt|ƒƒD]Û} || }||ƒ}x@|D]8} | | |kr| j | | d| | fƒqqW| j |dƒyT|ˆ|d|d| d| dˆƒ\} }|d |} |j || | ƒWq÷tj k rÑq÷Xq÷W|r|jƒ} | V|j| ƒ| }q’Pq’Wd S( sºGenerate all simple paths in the graph G from source to target, starting from shortest ones. A simple path is a path with no repeated nodes. If a weighted shortest path search is to be used, no negative weights are allawed. Parameters ---------- G : NetworkX graph source : node Starting node for path target : node Ending node for path weight : string Name of the edge attribute to be used as a weight. If None all edges are considered to have unit weight. Default value None. Returns ------- path_generator: generator A generator that produces lists of simple paths, in order from shortest to longest. Raises ------ NetworkXNoPath If no path exists between source and target. NetworkXError If source or target nodes are not in the input graph. NetworkXNotImplemented If the input graph is a Multi[Di]Graph. Examples -------- >>> G = nx.cycle_graph(7) >>> paths = list(nx.shortest_simple_paths(G, 0, 3)) >>> print(paths) [[0, 1, 2, 3], [0, 6, 5, 4, 3]] You can use this function to efficiently compute the k shortest/best paths between two nodes. >>> from itertools import islice >>> def k_shortest_paths(G, source, target, k, weight=None): ... return list(islice(nx.shortest_simple_paths(G, source, target, weight=weight), k)) >>> for path in k_shortest_paths(G, 0, 3, 2): ... print(path) [0, 1, 2, 3] [0, 6, 5, 4, 3] Notes ----- This procedure is based on algorithm by Jin Y. Yen [1]_. Finding the first K paths requires O(KN^3) operations. See Also -------- all_shortest_paths shortest_path all_simple_paths References ---------- .. [1] Jin Y. Yen, "Finding the K Shortest Loopless Paths in a Network", Management Science, Vol. 17, No. 11, Theory Series (Jul., 1971), pp. 712-716. ssource node %s not in graphstarget node %s not in graphcs*t‡‡fd†t||dƒDƒƒS(Nc3s*|] \}}ˆj||ˆVqdS(N(tedge(RRR(Rtweight(st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pys åsi(tsumtzip(tpath(RR"(st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyt length_funcäsR"iiÿÿÿÿt ignore_nodest ignore_edgesN(RRR R t_bidirectional_shortest_patht_bidirectional_dijkstraRt PathBuffertTruetpushtsetRtaddtNetworkXNoPathRR(RRRR"R&tshortest_path_functlistAtlistBt prev_pathtlengthR%R'R(Rtroott root_lengthtspur((RR"st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyRŒsPN            &   R+cBs,eZd„Zd„Zd„Zd„ZRS(cCs(tƒ|_tƒ|_tƒ|_dS(N(R.tpathsRt sortedpathsRtcounter(tself((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyt__init__s  cCs t|jƒS(N(R R:(R<((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyt__len__scCsTt|ƒ}||jkrPt|j|t|jƒ|fƒ|jj|ƒndS(N(ttupleR9RR:RR;R/(R<tcostR%t hashable_path((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR-s "cCs8t|jƒ\}}}t|ƒ}|jj|ƒ|S(N(RR:R?R9tremove(R<R@tnumR%RA((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyRs (t__name__t __module__R=R>R-R(((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR+ s   c Cs¢t|||||ƒ}|\}}} g} x'| dk rV| j| ƒ|| } q0W|| d} x*| dk r‘| jd| ƒ|| } qhWt| ƒ| fS(s®Return the shortest path between source and target ignoring nodes and edges in the containers ignore_nodes and ignore_edges. This is a custom modification of the standard bidirectional shortest path implementation at networkx.algorithms.unweighted Parameters ---------- G : NetworkX graph source : node starting node for path target : node ending node for path ignore_nodes : container of nodes nodes to ignore, optional ignore_edges : container of edges edges to ignore, optional weight : None This function accepts a weight argument for convinience of shortest_simple_paths function. It will be ignored. Returns ------- path: list List of nodes in a path from source to target. Raises ------ NetworkXNoPath If no path exists between source and target. See Also -------- shortest_path iN(t_bidirectional_pred_succR RtinsertR ( RRRR'R(R"tresultstpredtsucctwR%((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR)#s. cs\||kr'id|6id|6|fS|jƒrH|j}|j}n|j}|j}ˆrŠ‡fd†}||ƒ}||ƒ}nˆrÿ|jƒrÕ‡fd†}‡fd†} ||ƒ}| |ƒ}qÿ‡fd†}||ƒ}||ƒ}nid|6} id|6} |g} |g} x| r>| r>t| ƒt| ƒkrÈ| }g} xÚ|D]\}xS||ƒD]E}|| kr¤| j|ƒ|| |esc3s'|]\}}|jˆdƒVqdS(iN(R\(RR]R^(R"(st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pys lss,Contradictory paths found: negative weights?sNo path between %s and %s.N(RSRTRURVRRRRR tmintitemsR\t ValueErrortreverseRR0(RRRR"R'R(RWRXRNRPRRR-RtdistsR9tfringetseentctneighst finalpathtdirtdistt_Rt finaldistRKt minweighttvwLengtht totaldisttrevpath((R(R'R"st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyR*ÄsˆD                       $   '(theapqRRt itertoolsRtnetworkxRtnetworkx.utilsRtjoint __author__t__all__R RR R RtobjectR+R)RFR*(((st/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/simple_paths.pyts*     D    =a