Skip to content

NetworkGraph

Defined in: network/graph.ts:140

Network graph: directed-edge SoA for rendering + CSR for traversal.

csr: CSR

Defined in: network/graph.ts:151

Undirected adjacency for layout/traversal.


degree: Uint32Array

Defined in: network/graph.ts:157

Per-node degree: the number of incident edges, length nodeCount. A self-link counts ONCE (#535), as Infomap counts it, so a node with one self-link and one other link has degree 2. (The adjacency row length, where a self-link takes two entries, is CSR.degree.)


directed: boolean

Defined in: network/graph.ts:172

Whether links render with arrowheads.


edgeCount: number

Defined in: network/graph.ts:142


flow: Float32Array<ArrayBufferLike> | null

Defined in: network/graph.ts:170

Per-node flow (e.g. an Infomap visit rate), length nodeCount, or null when the caller supplied none. A model quantity the app provides via BuildGraphInput.nodeFlow — d3gl does not derive it. Available to nodeRadius sizing as the "flow" metric.


nodeCount: number

Defined in: network/graph.ts:141


positions: Float32Array

Defined in: network/graph.ts:149

Interleaved node positions [x, y, ...], length 2 * nodeCount; filled by layout.


source: Uint32Array

Defined in: network/graph.ts:144

Directed edge endpoints (node indices), length edgeCount.


strength: Float32Array

Defined in: network/graph.ts:164

Per-node strength: the sum of incident edge weights (weighted degree), length nodeCount. A self-link of weight w adds w ONCE (#535), as Infomap’s weighted degree does (2 · Σw − Σw_self over the network). A purely structural metric derived from the edge list — a sizing input alongside NetworkGraph.degree. (Not flow in the map-equation sense; that is NetworkGraph.flow.)


target: Uint32Array

Defined in: network/graph.ts:145


weight: Float32Array

Defined in: network/graph.ts:147

Per-edge weight (flow), length edgeCount.