Hierarchy
Defined in: network/coarsen.ts:39
A coarsening hierarchy: progressively smaller graphs plus the maps that connect them.
Properties
Section titled “Properties”levels
Section titled “levels”levels:
CoarseLevel[]
Defined in: network/coarsen.ts:41
levels[0] is the finest (original) graph; each subsequent level is strictly coarser.
projections
Section titled “projections”projections:
Uint32Array<ArrayBufferLike>[]
Defined in: network/coarsen.ts:43
projections[k] maps a level-k node id to its level-k+1 node id; length levels.length - 1.