Oh4Q6dZddlmZddlmZGddeZy)z altgraph.Graph - Base Graph class ================================= .. #--Version 2.1 #--Bob Ippolito October, 2004 #--Version 2.0 #--Istvan Albert June, 2004 #--Version 1.0 #--Nathan Denny, May 27, 1999 )deque) GraphErrorcneZdZdZd9dZdZd9dZd:dZdZdZ d Z d Z d Z d Z d ZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZdZ d Z!d!Z"d"Z#d#Z$d$Z%d%Z&d&Z'd'Z(d(Z)d;d)Z*d*Z+d+Z,d;d,Z-d-Z.d.Z/dGrapha The Graph class represents a directed graph with *N* nodes and *E* edges. Naming conventions: - the prefixes such as *out*, *inc* and *all* will refer to methods that operate on the outgoing, incoming or all edges of that node. For example: :py:meth:`inc_degree` will refer to the degree of the node computed over the incoming edges (the number of neighbours linking to the node). - the prefixes such as *forw* and *back* will refer to the orientation of the edges used in the method with respect to the node. For example: :py:meth:`forw_bfs` will start at the node then use the outgoing edges to traverse the graph (goes forward). Ncd|_iic|_|_iic|_|_|c|D]]}t |dk(r|\}}|j ||)t |dk(r|\}}}|j |||Qtd|yy)z Initialization rNzCannot create edge from ) next_edgenodesedges hidden_edges hidden_nodeslenadd_edger)selfr itemheadtaildatas `/mnt/c/Users/Administrator/Desktop/help_/test_env/lib/python3.12/site-packages/altgraph/Graph.py__init__zGraph.__init__)s !#R DJ/12,4,   Mt9>!%JD$MM$-Y!^'+$D$MM$d3$T%KLL M cHd|j|jfzS)Nz)number_of_nodesnumber_of_edgesrs r__repr__zGraph.__repr__=s,,  "  "0   rcd||jvry||jvrgg|f|j|<yy)z Adds a new node to the graph. Arbitrary data can be attached to the node via the node_data parameter. Adding the same node twice will be silently ignored. The node must be a hashable value. N)rr )rnode node_datas radd_nodezGraph.add_nodeCs; 4$$ $  tzz ! "B 2DJJt  "rct|j}|r"|j||j| |j|dj||j|dj||||f|j |<|xjdz c_y#t$rt d|d|wxYw)a Adds a directed edge going from head_id to tail_id. Arbitrary data can be attached to the edge via edge_data. It may create the nodes if adding edges between nonexisting ones. :param head_id: head node :param tail_id: tail node :param edge_data: (optional) data attached to the edge :param create_nodes: (optional) creates the head_id or tail_id node in case they did not exist rzInvalid nodes z -> N)r r!r appendKeyErrorrr )rhead_idtail_id edge_data create_nodesedges rrzGraph.add_edgeYs~~  MM' " MM' "  L JJw  " ) )$ / JJw  " ) )$ / $Wi8 4 !  L'JK K Ls ABB7c |j|x\}}}|j|<|j|dj||j|dj||j|=y#t$rt d|zwxYw)zd Hides an edge from the graph. The edge may be unhidden at some later time. rr#Invalid edge %sN)r r r remover%r)rr*r&r'r(s r hide_edgezGraph.hide_edge|s  7DHJJtDT T 'GWi$*;*;D*A JJw  " ) )$ / JJw  " ) )$ / 4  7.56 6 7s A1A44B c |j|}|j||f|j|<|D]}|j||j|=y#t$rt d|zwxYw)z Hides a node from the graph. The incoming and outgoing edges of the node will also be hidden. The node may be unhidden at some later time. Invalid node %sN) all_edgesr rr.r%rrrr1r*s r hide_nodezGraph.hide_nodesz  7t,I'+zz$'7&CD  d #! %t$ % 4  7.56 6 7s AAA/c |j|\|j|<}|D]}|j||j|=y#t$rt d|zwxYw)z Restores a previously hidden node back into the graph and restores all of its incoming and outgoing edges. r0N)rr restore_edger%rr2s r restore_nodezGraph.restore_nodesp  7*.*;*;D*A 'DJJt i! (!!$' (!!$' 7.56 6 7s AAAc$ |j|\}}}|j|dj||j|dj||||f|j|<|j|=y#t$rt d|zwxYw)zH Restores a previously hidden edge back into the graph. rr#r,N)r r r$r r%r)rr*r&r'rs rr5zGraph.restore_edges 7%)%6%6t%< "GWd JJw  " ) )$ / JJw  " ) )$ /&5DJJt !!$' 7.56 6 7s A4A77Bct|jjD]} |j|y#t$rY#wxYw)z, Restores all hidden edges. N)listr keysr5rrr*s rrestore_all_edgeszGraph.restore_all_edgessN**//12 D !!$'   s< AAcvt|jjD]}|j|y)z, Restores all hidden nodes. N)r9rr:r6rrs rrestore_all_nodeszGraph.restore_all_nodess5**//12 $D   d # $rc||jvS)z5 Test whether a node is in the graph r r>s r __contains__zGraph.__contains__stzz!!rcr |j|\}}}||fS#t$rd\}}td|zwxYw)N Returns the edge that connects the head_id and tail_id nodes )NNr,)r r%rrr*rrrs r edge_by_idzGraph.edge_by_idsS 7#zz$/ D$ d|  7#JD$.56 6 7s6c`|j|D]}|j||k(s|cSy)rDN out_edgesr)rrrr*s r edge_by_nodezGraph.edge_by_nodes6NN4( Dyy$&  rc,t|jS)z- Returns the number of nodes )rr rs rrzGraph.number_of_nodes4::rc,t|jS)z- Returns the number of edges )rr rs rrzGraph.number_of_edgesrLrc,t|jS)z6 Iterates over all nodes in the graph )iterr rs r__iter__zGraph.__iter__sDJJrcHt|jjS)zS Return a list of the node ids for all visible nodes in the graph. )r9r r:rs r node_listzGraph.node_listDJJOO%&&rcHt|jjS)zI Returns an iterator for all visible nodes in the graph. )r9r r:rs r edge_listzGraph.edge_listrSrc,t|jS)z4 Returns the number of hidden edges )rr rs rnumber_of_hidden_edgeszGraph.number_of_hidden_edges4$$%%rc,t|jS)z4 Returns the number of hidden nodes )rrrs rnumber_of_hidden_nodeszGraph.number_of_hidden_nodesrXrcHt|jjS)z8 Returns the list with the hidden nodes )r9rr:rs rhidden_node_listzGraph.hidden_node_listD%%**,--rcHt|jjS)z6 Returns a list with the hidden edges )r9r r:rs rhidden_edge_listzGraph.hidden_edge_list r]rc4|j|\}}}||||fS)zQ return node, node data, outgoing edges, incoming edges for node rA)rrincomingoutgoingrs r describe_nodezGraph.describe_nodes($(::d#3 (DT8X--rc4|j|\}}}||||fS)z= return edge, edge data, head, tail for edge r rEs r describe_edgezGraph.describe_edges( ::d+dDT4%%rc&|j|dS)z9 Returns the data associated with a node rrAr>s rr zGraph.node_data!zz$""rc&|j|dS)z: Returns the data associated with an edge rrer;s rr(zGraph.edge_data'rhrcJ|j|dd|fz|j|<y)z; Replace the edge data for a specific edge rrNre)rr*r(s rupdate_edge_datazGraph.update_edge_data-s) ::d+Aa0I<? 4rc&|j|dS)z; Returns the node of the head of the edge. rrer;s rrz Graph.head3rhrc&|j|dS)z7 Returns node of the tail of the edge. r#rer;s rrz Graph.tail9rhrch|j|Dcgc]}|j|c}Scc}w)z; List of nodes connected by outgoing edges rHrrns rout_nbrszGraph.out_nbrs?)'+nnT&:; ! ;;;/ch|j|Dcgc]}|j|c}Scc}w)z; List of nodes connected by incoming edges ) inc_edgesrros rinc_nbrszGraph.inc_nbrsErrrscttj|j||j |zS)zH List of nodes connected by incoming and outgoing edges )r9dictfromkeysrvrqr>s rall_nbrszGraph.all_nbrsKs/DMM$--"5 d8K"KLMMrcp t|j|dS#t$rtd|zwxYw)z6 Returns a list of the outgoing edges r#r0r9r r%rr>s rrIzGraph.out_edgesQ@ 7 4(+, , 7.56 6 75cp t|j|dS#t$rtd|zwxYw)z6 Returns a list of the incoming edges rr0r|r>s rruzGraph.inc_edgesZr}r~cZt|j||j|zS)z? Returns a list of incoming and outging edges. )setrurIr>s rr1zGraph.all_edgescs&4>>$'$..*>>??rc6t|j|S)z6 Returns the number of outgoing edges )rrIr>s r out_degreezGraph.out_degreei4>>$'((rc6t|j|S)z6 Returns the number of incoming edges )rrur>s r inc_degreezGraph.inc_degreeorrcH|j||j|zS)z, The total degree of a node )rrr>s r all_degreezGraph.all_degreeus!t$tt'<<S!12 2E y!!Ey!!rc&|jdS)z Topological sort. Returns a list of nodes where the successors (based on outgoing edges) of any given node appear in the sequence after that node. Trrrs rforw_topo_sortzGraph.forw_topo_sortst,,rc&|jdS)z Reverse topological sort. Returns a list of nodes where the successors (based on incoming edges) of any given node appear in the sequence after that node. Frrrs rback_topo_sortzGraph.back_topo_sortsu--rc6|r|j}|j}n|j}|j}t }||}|D]}|j ||D]6}||D])}|r|j |||j ||+8|S)z Private method creates a subgraph in a bfs order. The forward parameter specifies whether it is a forward or backward traversal. )forw_bfsrqback_bfsrvrr!r) rstart_idrget_bfsget_nbrsgbfs_listrnbr_ids r _bfs_subgraphzGraph._bfs_subgraphs mmG}}HmmG}}H G8$ D JJt   -D"4. -JJtV,JJvt,  - -rc(|j|dS)z Creates and returns a subgraph consisting of the breadth first reachable nodes based on their outgoing edges. Trrrrs rforw_bfs_subgraphzGraph.forw_bfs_subgraphs !!(D!99rc(|j|dS)z Creates and returns a subgraph consisting of the breadth first reachable nodes based on the incoming edges. Frrrs rback_bfs_subgraphzGraph.back_bfs_subgraphs !!(E!::rc#ZK|ht|g}}|r|j}|j}n|j}|j}|rc|j }|||k(ryt ||D]1} || } | |vs|j| |j| 3|rbyyw)z Collecting nodes in some depth first traversal. The forward parameter specifies whether it is a forward or backward traversal. N) rrIrrurpopsortedaddr$) rstartendrvisitedstackrrrr*rs riterdfsz Graph.iterdfss %. IyyHIyyH IOCy34 '~w&KK%LL&  ' sA?B+&B+)B+c#K|ht|g}}|r|j}|j}n|j}|j}|j } |ro|j } | | } | | || s'| | |k(ry|| D]1} || } | |vs|j| |j| 3|rnyyw)z Perform a depth-first walk of the graph (as ``iterdfs``) and yield the item data of every node where condition matches. The condition callback is only called when node_data is not None. N) rrIrrurr rrr$)rrrr conditionrrrrget_datar curr_datar*rs riterdatazGraph.iterdatas %. IyyHIyyH>> I +I$(91EC!), '~w&KK%LL&  'sBC&CCc#`Kt|dfg|h}}|r|j}|j}n|j}|j}|rd|j \}} || f||k(ry||D]6} || } | |vs|j | |j| | dzf8|rcyyw)z The forward parameter specifies whether it is a forward or backward traversal. Returns a list of tuples where the first value is the hop value the second value is the node id. rr#N)rrIrrurrrr$) rrrrrrrrr curr_stepr*rs r_iterbfszGraph._iterbfs"s  |,ugw IyyHIyyH#(==? Iyi( (C!), 8~w&KK%LL$ A !67  8 sA=B.+B.,B.c\|j||dDcgc]\}}| c}}Scc}}w)z Returns a list of nodes in some forward BFS order. Starting from the start node the breadth first search proceeds along outgoing edges. Trr)rrrrsteps rrzGraph.forw_bfs=s+(,}}UC}'NOtOOO (c\|j||dDcgc]\}}| c}}Scc}}w)z Returns a list of nodes in some backward BFS order. Starting from the start node the breadth first search proceeds along incoming edges. Frr)rrrr_s rrzGraph.back_bfsFs+%)MM%eM$LMqMMMrc<t|j||dS)z Returns a list of nodes in some forward DFS order. Starting with the start node the depth first search proceeds along outgoing edges. Trr9rrrrs rforw_dfszGraph.forw_dfsOsDLLTL:;;rc<t|j||dS)z Returns a list of nodes in some backward DFS order. Starting from the start node the depth first search proceeds along incoming edges. Frrrs rback_dfszGraph.back_dfsXsDLLUL;< for a formal definition. rr#g)rrqr-rfloat)rrnumnbr_setnbrsec_setnbr_num clust_coefs rrzGraph.clust_coefmsdmmD)* 7? NN4  *C$--,-Gg~s# 3w() )C  * g, sw'A+'>?JJrcz|rt|j||dSt|j||dS)a$ Computes the hop distance to all nodes centered around a node. First order neighbours are at hop 1, their neigbours are at hop 2 etc. Uses :py:meth:`forw_bfs` or :py:meth:`back_bfs` depending on the value of the forward parameter. If the distance between all neighbouring nodes is 1 the hop number corresponds to the shortest distance between the nodes. :param start: the starting node :param end: ending node (optional). When not specified will search the whole graph. :param forward: directionality parameter (optional). If C{True} (default) it uses L{forw_bfs} otherwise L{back_bfs}. :return: returns a list of tuples where each tuple contains the node and the hop. Typical usage:: >>> print (graph.get_hops(1, 8)) >>> [(1, 0), (2, 1), (3, 1), (4, 2), (5, 3), (7, 4), (8, 5)] # node 1 is at 0 hops # node 2 is at 1 hop # ... # node 8 is at 5 hops T)rrrF)r9r)rrrrs rget_hopszGraph.get_hopss;6  EsD IJ J EsE JK Kr)N)r#T)T)NT)NTN):__name__ __module__ __qualname____doc__rrr!rr.r3r6r5r<r?rBrFrJrrrPrRrUrWrZr\r_rcrfr r(rkrrrqrvrzrIrur1rrrrrrrrrrrrrrrrrrrrrrrs&M( 3,!F 7 7 7 7$"    ' ' & & . . .&# # @ # # < < N 77@ ) ) = -"^-.8:;'6'B86PN<= >LrrN)r collectionsraltgraphrobjectrrrrrs" U LFU Lr