U
|
K ±d4Q ã @ s0 d Z ddlmZ ddlmZ G dd deZdS )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)Ú
|
GraphErrorc @ sÚ e Zd ZdZdqddZdd ZdrddZdsd d Zd d Zdd Z dd Z
|
dd Z dd Z dd Z dd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Zd'd( Zd)d* Zd+d, Zd-d. Zd/d0 Zd1d2 Zd3d4 Zd5d6 Z d7d8 Z d9d: Z d;d< Z d=d> Z d?d@ Z!dAdB Z"dCdD Z#dEdF Z$dGdH Z%dIdJ Z&dKdL Z'dMdN Z(dOdP Z)dtdQdRZ*dSdT Z+dUdV Z,dudWdXZ-dYdZ Z.d[d\ Z/dvd]d^Z0dwd_d`Z1dxdadbZ2dydcddZ3dzdedfZ4d{dgdhZ5d|didjZ6dkdl Z7dmdn Z8d}dodpZ9dS )~ÚGrapha¼
|
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).
|
Nc C s d| _ i i | _| _i i | _| _|dk r|D ]Z}t|dkrT|\}}| ||¡ q.t|dkrz|\}}}| |||¡ q.td|f q.dS )z
|
Initialization
|
r Né é zCannot create edge from %s)Ú next_edgeÚnodesÚedgesÚ hidden_edgesÚ hidden_nodesÚlenÚadd_edger )Úselfr ÚitemÚheadÚtailÚdata© r úEd:\z\workplace\vscode\pyvenv\venv\Lib\site-packages\altgraph/Graph.pyÚ__init__) s
|
zGraph.__init__c C s d| ¡ | ¡ f S )Nz<Graph: %d nodes, %d edges>)Únumber_of_nodesÚnumber_of_edges©r r r r Ú__repr__= s þzGraph.__repr__c C s, || j krdS || jkr(g g |f| j|< dS )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)r r )r ÚnodeÚ node_datar r r Úadd_nodeC s
|
|
zGraph.add_nodeé Tc C s | j }|r | |¡ | |¡ z,| j| d |¡ | j| d |¡ W n$ tk
|
rn td||f Y nX |||f| j|< | j d7 _ dS )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
|
r r zInvalid nodes %s -> %sN)r r r ÚappendÚKeyErrorr r )r Úhead_idÚtail_idÚ edge_dataZ create_nodesÚedger r r r Y s
|
|
zGraph.add_edgec C st zN| j | \}}}| j|< | j| d |¡ | j| d |¡ | j |= W n tk
|
rn td| Y nX dS )zd
|
Hides an edge from the graph. The edge may be unhidden at some later
|
time.
|
r r úInvalid edge %sN)r r
|
r Úremover r )r r# r r! r" r r r Ú hide_edge| s zGraph.hide_edgec C sd z>| |¡}| j| |f| j|< |D ]}| |¡ q$| j|= W n tk
|
r^ td| Y nX dS )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 r r& r r ©r r r( r# r r r Ú hide_node s
|
zGraph.hide_nodec C sZ z4| j | \| j|< }|D ]}| |¡ q| j |= W n tk
|
rT td| Y nX dS )z
|
Restores a previously hidden node back into the graph and restores
|
all of its incoming and outgoing edges.
|
r' N)r r Ú restore_edger r r) r r r Ú restore_node s zGraph.restore_nodec C sz zT| j | \}}}| j| d |¡ | j| d |¡ |||f| j|< | j |= W n tk
|
rt td| Y nX dS )zH
|
Restores a previously hidden edge back into the graph.
|
r r r$ N)r
|
r r r r r )r r# r r! r r r r r+ ¤ s zGraph.restore_edgec C s< t | j ¡ D ](}z| |¡ W q tk
|
r4 Y qX qdS )z,
|
Restores all hidden edges.
|
N)Úlistr
|
Úkeysr+ r ©r r# r r r Úrestore_all_edges± s
|
zGraph.restore_all_edgesc C s" t | j ¡ D ]}| |¡ qdS )z,
|
Restores all hidden nodes.
|
N)r- r r. r, ©r r r r r Úrestore_all_nodes» s zGraph.restore_all_nodesc C s
|
|| j kS )z5
|
Test whether a node is in the graph
|
©r r1 r r r Ú __contains__Â s zGraph.__contains__c C sF z| j | \}}}W n( tk
|
r< d\}}td| Y nX ||fS )úN
|
Returns the edge that connects the head_id and tail_id nodes
|
)NNr$ )r r r ©r r# r r r r r r Ú
|
edge_by_idÈ s zGraph.edge_by_idc C s* | |¡D ]}| |¡|kr
|
| S q
|
dS )r5 N)Ú out_edgesr )r r r r# r r r Ú edge_by_nodeÔ s
|
zGraph.edge_by_nodec C s
|
t | jS )z-
|
Returns the number of nodes
|
)r r r r r r r Ý s zGraph.number_of_nodesc C s
|
t | jS )z-
|
Returns the number of edges
|
)r r r r r r r ã s zGraph.number_of_edgesc C s
|
t | jS )z6
|
Iterates over all nodes in the graph
|
)Úiterr r r r r Ú__iter__é s zGraph.__iter__c C s t | j ¡ S )zS
|
Return a list of the node ids for all visible nodes in the graph.
|
)r- r r. r r r r Ú node_listï s zGraph.node_listc C s t | j ¡ S )zI
|
Returns an iterator for all visible nodes in the graph.
|
)r- r r. r r r r Ú edge_listõ s zGraph.edge_listc C s
|
t | jS )z4
|
Returns the number of hidden edges
|
)r r
|
r r r r Únumber_of_hidden_edgesû s z Graph.number_of_hidden_edgesc C s
|
t | jS )z4
|
Returns the number of hidden nodes
|
)r r r r r r Únumber_of_hidden_nodes s z Graph.number_of_hidden_nodesc C s t | j ¡ S )z8
|
Returns the list with the hidden nodes
|
)r- r r. r r r r Úhidden_node_list s zGraph.hidden_node_listc C s t | j ¡ S )z6
|
Returns a list with the hidden edges
|
)r- r
|
r. r r r r Úhidden_edge_list s zGraph.hidden_edge_listc C s | j | \}}}||||fS )zQ
|
return node, node data, outgoing edges, incoming edges for node
|
r3 )r r ÚincomingÚoutgoingr r r r Ú describe_node s zGraph.describe_nodec C s | j | \}}}||||fS )z=
|
return edge, edge data, head, tail for edge
|
©r r6 r r r Ú describe_edge s zGraph.describe_edgec C s | j | d S )z9
|
Returns the data associated with a node
|
r r3 r1 r r r r ! s zGraph.node_datac C s | j | d S )z:
|
Returns the data associated with an edge
|
r rE r/ r r r r" ' s zGraph.edge_datac C s" | j | dd
|f | j |< dS )z;
|
Replace the edge data for a specific edge
|
r r NrE )r r# r" r r r Úupdate_edge_data- s zGraph.update_edge_datac C s | j | d S )z;
|
Returns the node of the head of the edge.
|
r rE r/ r r r r 3 s z
|
Graph.headc C s | j | d S )z7
|
Returns node of the tail of the edge.
|
r rE r/ r r r r 9 s z
|
Graph.tailc s fdd |¡D S )z;
|
List of nodes connected by outgoing edges
|
c s g | ]} |¡qS r )r ©Ú.0Únr r r Ú
|
<listcomp>C s z"Graph.out_nbrs.<locals>.<listcomp>)r8 r1 r r r Úout_nbrs? s zGraph.out_nbrsc s fdd |¡D S )z;
|
List of nodes connected by incoming edges
|
c s g | ]} |¡qS r )r rH r r r rK I s z"Graph.inc_nbrs.<locals>.<listcomp>)Ú inc_edgesr1 r r r Úinc_nbrsE s zGraph.inc_nbrsc C s t t | |¡| |¡ ¡S )zH
|
List of nodes connected by incoming and outgoing edges
|
)r- ÚdictÚfromkeysrN rL r1 r r r Úall_nbrsK s zGraph.all_nbrsc C s: zt | j| d W S tk
|
r4 td| Y nX dS )z6
|
Returns a list of the outgoing edges
|
r r' N©r- r r r r1 r r r r8 Q s zGraph.out_edgesc C s: zt | j| d W S tk
|
r4 td| Y nX dS )z6
|
Returns a list of the incoming edges
|
r r' NrR r1 r r r rM Z s zGraph.inc_edgesc C s t | |¡| |¡ S )z?
|
Returns a list of incoming and outging edges.
|
)ÚsetrM r8 r1 r r r r( c s zGraph.all_edgesc C s t | |¡S )z6
|
Returns the number of outgoing edges
|
)r r8 r1 r r r Ú
|
out_degreei s zGraph.out_degreec C s t | |¡S )z6
|
Returns the number of incoming edges
|
)r rM r1 r r r Ú
|
inc_degreeo s zGraph.inc_degreec C s | |¡| |¡ S )z,
|
The total degree of a node
|
)rU rT r1 r r r Ú
|
all_degreeu s zGraph.all_degreec C sè g }t }i }|r&| j}| j}| j}n| j}| j}| j}| ¡ D ]$}||} | rZ| ||< q@| |¡ q@|rÂ| ¡ }
|
| |
|
¡ ||
|
D ]:} || } | |kr|| d8 < || dkr| | ¡ qqft
|
|t
|
| ¡ krÜd} nd} | |fS )zì
|
Topological sort.
|
|
Returns a list of nodes where the successors (based on outgoing and
|
incoming edges selected by the forward parameter) of any given node
|
appear in the sequence after that node.
|
r r TF) r r8 rU r rM rT r r< r Úpopleftr )r ÚforwardZ topo_listÚqueueZindegÚ get_edgesZ
|
get_degreeÚget_nextr ZdegreeÚ curr_noder# r! Zvalidr r r Ú
|
_topo_sort{ s8
|
|
zGraph._topo_sortc C s | j ddS )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.
|
T©rX ©r] r r r r Úforw_topo_sortª s zGraph.forw_topo_sortc C s | j ddS )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.
|
Fr^ r_ r r r r Úback_topo_sort³ s zGraph.back_topo_sortc C sz |r| j }| j}n | j}| j}t }||}|D ]}| |¡ q0|D ]0}||D ]"}|rf| ||¡ qP| ||¡ qPqD|S )z£
|
Private method creates a subgraph in a bfs order.
|
|
The forward parameter specifies whether it is a forward or backward
|
traversal.
|
)Úforw_bfsrL Úback_bfsrN r r r ) r Ústart_idrX Zget_bfsZget_nbrsÚgÚbfs_listr Znbr_idr r r Ú _bfs_subgraph¼ s zGraph._bfs_subgraphc C s | j |ddS )z
|
Creates and returns a subgraph consisting of the breadth first
|
reachable nodes based on their outgoing edges.
|
Tr^ ©rg ©r rd r r r Úforw_bfs_subgraphØ s zGraph.forw_bfs_subgraphc C s | j |ddS )z
|
Creates and returns a subgraph consisting of the breadth first
|
reachable nodes based on the incoming edges.
|
Fr^ rh ri r r r Úback_bfs_subgraphß s zGraph.back_bfs_subgraphc c s |ht |g }}|r$| j}| j}n | j}| j}|r| ¡ }|V ||krLqt||D ](} || }
|
|
|
|krX| |
|
¡ | |
|
¡ qXq0dS )z¡
|
Collecting nodes in some depth first traversal.
|
|
The forward parameter specifies whether it is a forward or backward
|
traversal.
|
N) r r8 r rM r ÚpopÚsortedÚaddr ) r ÚstartÚendrX ÚvisitedÚstackrZ r[ r\ r# r r r r Úiterdfsæ s
|
z Graph.iterdfsc c s¬ |ht |g }}|r$| j}| j}n | j}| j}| j} |r¨| ¡ }
|
| |
|
} | dk rj|dk rd|| sdq6| V |
|
|krtq¨||
|
D ](} || } | |kr|| | ¡ | | ¡ q|q6dS )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) r r8 r rM r r rl rn r )r ro rp rX Ú conditionrq rr rZ r[ Úget_datar\ Z curr_datar# r r r r Úiterdata s*
|
zGraph.iterdatac c s t |dfg|h }}|r(| j}| j}n | j}| j}|r| ¡ \}} || fV ||krXq||D ]0}
|
||
|
} | |kr`| | ¡ | | | d f¡ q`q4dS )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.
|
r r N)r r8 r rM r rW rn r ) r ro rp rX rY rq rZ r[ r\ Z curr_stepr# r r r r Ú_iterbfs" s
|
|
zGraph._iterbfsc C s dd | j ||ddD S )zª
|
Returns a list of nodes in some forward BFS order.
|
|
Starting from the start node the breadth first search proceeds along
|
outgoing edges.
|
c S s g | ] \}}|qS r r )rI r Ústepr r r rK D s z"Graph.forw_bfs.<locals>.<listcomp>Tr^ ©rw ©r ro rp r r r rb = s zGraph.forw_bfsc C s dd | j ||ddD S )z«
|
Returns a list of nodes in some backward BFS order.
|
|
Starting from the start node the breadth first search proceeds along
|
incoming edges.
|
c S s g | ] \}}|qS r r )rI r Ú_r r r rK M s z"Graph.back_bfs.<locals>.<listcomp>Fr^ ry rz r r r rc F s zGraph.back_bfsc C s t | j||ddS )z¨
|
Returns a list of nodes in some forward DFS order.
|
|
Starting with the start node the depth first search proceeds along
|
outgoing edges.
|
Tr^ ©r- rs rz r r r Úforw_dfsO s zGraph.forw_dfsc C s t | j||ddS )z©
|
Returns a list of nodes in some backward DFS order.
|
|
Starting from the start node the depth first search proceeds along
|
incoming edges.
|
Fr^ r| rz r r r Úback_dfsX s zGraph.back_dfsc C s6 | ¡ }|D ]$}| |¡}t|t|kr dS q dS )zq
|
Returns :py:data:`True` if the graph's every node can be reached from
|
every other node.
|
FT)r< rb r )r r< r rf r r r Ú connecteda s
|
zGraph.connectedc C s d}t | |¡}||kr$| |¡ |D ]4}t | |¡}||krL| |¡ |t||@ 7 }q(t|}|rt|||d }nd}|S )a
|
Computes and returns the local clustering coefficient of node.
|
|
The local cluster coefficient is proportion of the actual number of
|
edges between neighbours of node and the maximum number of edges
|
between those neighbours.
|
|
See "Local Clustering Coefficient" on
|
<http://en.wikipedia.org/wiki/Clustering_coefficient>
|
for a formal definition.
|
r r g )rS rL r% r Úfloat)r r ÚnumZnbr_setZnbrZsec_setZnbr_numÚ
|
clust_coefr r r r m s
|
|
zGraph.clust_coefc C s0 |rt | j||ddS t | j||ddS 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)ro rp rX FN)r- rw )r ro rp rX r r r Úget_hops s zGraph.get_hops)N)N)r T)T)T)NT)NTN)NT)N)N)N)N)NT):Ú__name__Ú
|
__module__Ú __qualname__Ú__doc__r r r r r& r* r, r+ r0 r2 r4 r7 r9 r r r; r< r= r> r? r@ rA rD rF r r" rG r r rL rN rQ r8 rM r( rT rU rV r] r` ra rg rj rk rs rv rw rb rc r} r~ r r r r r r r r sn
|
|
|
#
|
|
/
|
|
|
!
|
|
|
|
|
r N)r Ú collectionsr Zaltgraphr Úobjectr r r r r Ú<module> s
|
