Note
This is the documentation for the current state of the development branch of rustworkx. The documentation or APIs here can change prior to being released.
PyGraph#
- class PyGraph(multigraph=True, attrs=None, *, node_count_hint=None, edge_count_hint=None)#
Bases:
object
A class for creating undirected graphs
The PyGraph class is used to create an undirected graph. It can be a multigraph (have multiple edges between nodes). Each node and edge (although rarely used for edges) is indexed by an integer id. These ids are stable for the lifetime of the graph object and on node or edge deletions you can have holes in the list of indices for the graph. Node indices will be reused on additions after removal. For example:
import rustworkx as rx graph = rx.PyGraph() graph.add_nodes_from(list(range(5))) graph.add_nodes_from(list(range(2))) graph.remove_node(2) print("After deletion:", graph.node_indices()) res_manual = graph.add_node(None) print("After adding a new node:", graph.node_indices())
After deletion: NodeIndices[0, 1, 3, 4, 5, 6] After adding a new node: NodeIndices[0, 1, 2, 3, 4, 5, 6]
Additionally, each node and edge contains an arbitrary Python object as a weight/data payload. You can use the index for access to the data payload as in the following example:
import rustworkx as rx graph = rx.PyGraph() data_payload = "An arbitrary Python object" node_index = graph.add_node(data_payload) print("Node Index: %s" % node_index) print(graph[node_index])
Node Index: 0 An arbitrary Python object
The PyGraph implements the Python mapping protocol for nodes so in addition to access you can also update the data payload with:
import rustworkx as rx graph = rx.PyGraph() data_payload = "An arbitrary Python object" node_index = graph.add_node(data_payload) graph[node_index] = "New Payload" print("Node Index: %s" % node_index) print(graph[node_index])
Node Index: 0 New Payload
By default a
PyGraph
is a multigraph (meaning there can be parallel edges between nodes) however this can be disabled by setting themultigraph
kwarg toFalse
when calling thePyGraph
constructor. For example:import rustworkx as rx graph = rx.PyGraph(multigraph=False)
This can only be set at
PyGraph
initialization and not adjusted after creation. Whenmultigraph
is set toFalse
if a method call is made that would add a parallel edge it will instead update the existing edge’s weight/data payload.Each
PyGraph
object has anattrs
attribute which is used to contain additional attributes/metadata of the graph instance. By default this is set toNone
but can optionally be specified by using theattrs
keyword argument when constructing a new graph:graph = rustworkx.PyGraph(attrs=dict(source_path='/tmp/graph.csv'))
This attribute can be set to any Python object. Additionally, you can access and modify this attribute after creating an object. For example:
source_path = graph.attrs graph.attrs = {'new_path': '/tmp/new.csv', 'old_path': source_path}
The maximum number of nodes and edges allowed on a
PyGraph
object is \(2^{32} - 1\) (4,294,967,294) each. Attempting to add more nodes or edges than this will result in an exception being raised.- Parameters:
multigraph (bool) – When this is set to
False
the created PyGraph object will not be a multigraph. WhenFalse
if a method call is made that would add parallel edges the the weight/weight from that method call will be used to update the existing edge in place.attrs – An optional attributes payload to assign to the
attrs
attribute. This can be any Python object. If it is not specifiedattrs
will be set toNone
.node_count_hint (int) – An optional hint that will allocate enough capacity to store this many nodes before needing to grow. This does not prepopulate any nodes with data, it is only a potential performance optimization if the complete size of the graph is known in advance.
edge_count_hint (int) – An optional hint that will allocate enough capacity to store this many edges before needing to grow. This does not prepopulate any edges with data, it is only a potential performance optimization if the complete size of the graph is known in advance.
Methods
Add an edge between 2 nodes.
Add new edges to the graph.
Add new edges to the graph without python data.
Add a new node to the graph.
Add new nodes to the graph.
Get the index and data for the neighbors of a node.
Clears all nodes and edges
Clears all edges, leaves nodes intact
Add another PyGraph object into this PyGraph
Substitute a set of nodes with a single new node.
Return a shallow copy of the graph
Get the degree for a node
Get an edge index map
Return a list of all edge indices.
Return a list of indices of all edges between specified nodes
Get edge list
Return a new PyGraph object for an edge induced subgraph of this graph
Return a list of all edge data.
Extend graph from an edge list
Extend graph from a weighted edge list
Filters a graph's edges by some criteria conditioned on a edge's data payload and returns those edges' indices.
Filters a graph's nodes by some criteria conditioned on a node's data payload and returns those nodes' indices.
Find node within this graph given a specific weight
Create a new
PyGraph
object from an adjacency matrix with matrix elements of typefloat
Create a new
PyGraph
object from an adjacency matrix with matrix elements of typecomplex
Return the edge data for all the edges between 2 nodes.
Return the edge data for the edge between 2 nodes.
Return the edge data for the edge by its given index
Return the edge endpoints for the edge by its given index
Return the node data for a given node index
Return True if there is an edge between
node_a
andnode_b
.Return True if there is a node.
Detect if the graph has parallel edges or not
Get the endpoint indices and edge data for all edges of a node.
Return the index map of edges incident to a provided node
Return the list of edge indices incident to a provided node
Get the neighbors of a node.
Return a list of all node indices.
Return a list of all node indices.
Return a list of all node data.
Return the number of edges in the graph
Return the number of nodes in the graph
Get the endpoint indices and edge data for all edges of a node.
Read an edge list file and create a new PyGraph object from the contents
Remove an edge between 2 nodes.
Remove an edge identified by the provided index
Remove edges from the graph.
Remove a node from the graph.
Remove nodes from the graph.
Return a new PyGraph object for a subgraph of this graph
substitute_node_with_subgraph(self, node, other, edge_map_fn, /, node_filter=None, edge_weight_map=None
Generate a new
PyDiGraph
object from this graphGenerate a dot file from the graph
Update an edge's weight/payload in place
Update an edge's weight/data payload in place by the edge index
Get edge list with weights
Write an edge list file from the PyGraph object
Attributes
- attrs#
- multigraph#
Whether the graph is a multigraph (allows multiple edges between nodes) or not
If set to
False
multiple edges between nodes are not allowed and calls that would add a parallel edge will instead update the existing edge