Skip to main content

Module biadjacency

Module biadjacency 

Source
Expand description

Bipartite graph from biadjacency matrix (ALGO-CN-037).

Counterpart of igraph_biadjacency() in references/igraph/src/misc/bipartite.c:634-737.

A biadjacency matrix (also called incidence matrix of a bipartite graph) is an n1 × n2 matrix where rows correspond to vertices in partition 1 and columns to partition 2. Non-zero entries indicate edges between the corresponding vertices.

Structs§

BiadjacencyResult
Result of biadjacency.

Functions§

biadjacency
Build a bipartite graph from a biadjacency matrix.