from_biadjacency_matrix(A, create_using=None, edge_attribute='weight')
The nodes are labeled with the attribute bipartite
set to an integer 0 or 1 representing membership in part 0 or part 1 of the bipartite graph.
If :None:None:`create_using` is an instance of networkx.MultiGraph
or networkx.MultiDiGraph
and the entries of A are of type int
, then this function returns a multigraph (of the same type as :None:None:`create_using`) with parallel edges. In this case, :None:None:`edge_attribute` will be ignored.
A biadjacency matrix representation of a graph
Use specified graph for result. The default is Graph()
Name of edge attribute to store matrix numeric value. The data will have the same type as the matrix entry (int, float, (real,imag)).
Creates a new bipartite graph from a biadjacency matrix given as a SciPy sparse matrix.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.bipartite.matrix.biadjacency_matrix
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them