hiperwalk.CompleteBipartite

hiperwalk.CompleteBipartite(num_vert1, num_vert2, multiedges=None, weights=None)

Complete bipartite graph.

Parameters:

num_vert1: int

Number of vertices of the first part.

num_vert2: int

Number of vertices of the second part.

multiedges, weights: scipy.sparse.csr_array, default=None

See Graph Constructors.

Returns:

hiperwalk.Graph

See Graph Constructors for details.

See also

Graph Constructors

Notes

The vertices in the first part are labeled from 0 to num_vert1 - 1 and the vertices of the second part are labeled from num_vert1 to num_vert1 + num_vert2 - 1.

Methods

All methods are inherited from hiperwalk.Graph, hiperwalk.Multigraph, or hiperwalk.WeightedGraph.