Struct GraphDataBuilder 

pub struct GraphDataBuilder { /* private fields */ }

Builder that accumulates edges and node weights, then produces a GraphData.

This is the only way to construct a GraphData from raw edges. The builder validates inputs incrementally (on each add_edge call) and then builds the CSR layout in build.

Implementations

impl GraphDataBuilder

pub fn new(node_count: usize) -> Self

Create a new builder for a graph with node_count nodes.

All node weights default to 1.0, directed defaults to false, and the edge list starts empty.

pub fn directed(self) -> Self

Set the graph to directed mode.

pub fn add_edge( &mut self, src: usize, dst: usize, weight: f64, ) -> Result<&mut Self>

Add a weighted edge (src, dst, weight).

Returns Err(LeidenError::InconsistentStructure) if src or dst is out of range, or Err(LeidenError::InvalidEdgeWeight) if the weight is not finite and non-negative.

pub fn set_node_weight(&mut self, node: usize, weight: f64) -> Result<&mut Self>

Override the weight for a single node.

Returns Err(LeidenError::InconsistentStructure) if node is out of range.

pub fn build(self) -> Result<GraphData>

Consume the builder and produce a GraphData.

Delegates to the appropriate CSR constructor based on the directed flag. In Phase 1 only undirected construction is supported.