adjacency_matrix

adjacency_matrix(G, nodelist=None, weight='weight')

Return adjacency matrix of G.

Parameters :

G : graph

A NetworkX graph

nodelist : list, optional

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

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

The edge data key used to provide each value in the matrix. If None, then each edge has weight 1.

Returns :

A : numpy matrix

Adjacency matrix representation of G.

See also

to_numpy_matrix, to_dict_of_dicts

Notes

If you want a pure Python adjacency matrix representation try networkx.convert.to_dict_of_dicts which will return a dictionary-of-dictionaries format that can be addressed as a sparse matrix.

For MultiGraph/MultiDiGraph, the edges weights are summed. See to_numpy_matrix for other options.