to_scipy_sparse_matrix

to_scipy_sparse_matrix(G, nodelist=None, dtype=None, weight='weight', format='csr')

Return the graph adjacency matrix as a SciPy sparse matrix.

Parameters :

G : graph

The NetworkX graph used to construct the NumPy matrix.

nodelist : list, optional

The rows and columns are ordered according to the nodes in . If is None, then the ordering is produced by G.nodes().

dtype : NumPy data-type, optional

A valid NumPy dtype used to initialize the array. If None, then the NumPy default is used.

weight : string or None optional (default=’weight’)

The edge attribute that holds the numerical value used for the edge weight. If None then all edge weights are 1.

format : str in {‘bsr’, ‘csr’, ‘csc’, ‘coo’, ‘lil’, ‘dia’, ‘dok’}

The type of the matrix to be returned (default ‘csr’). For some algorithms different implementations of sparse matrices can perform better. See [R186] for details.

Returns :

M : SciPy sparse matrix

Graph adjacency matrix.

Notes

The matrix entries are populated using the edge attribute held in parameter weight. When an edge does not have that attribute, the value of the entry is 1.

For multiple edges the matrix values are the sums of the edge weights.

When does not contain every node in , the matrix is built from the subgraph of that is induced by the nodes in .

Uses lil_matrix format. To convert to other formats specify the format= keyword.

References

[R186]

(1, 2) Scipy Dev. References, “Sparse Matrices” http://docs.scipy.org/doc/scipy/reference/sparse.html

Examples

>>> G = nx.MultiDiGraph()
>>> G.add_edge(0,1,weight=2)
>>> G.add_edge(1,0)
>>> G.add_edge(2,2,weight=3)
>>> G.add_edge(2,2)
>>> S = nx.to_scipy_sparse_matrix(G, nodelist=[0,1,2])
>>> S.todense()
matrix([[ 0.,  2.,  0.],
        [ 1.,  0.,  0.],
        [ 0.,  0.,  4.]])