Struct MapperGraph 

pub struct MapperGraph {
    pub nodes: Vec<MapperNode>,
    pub edges: Vec<(usize, usize)>,
}

Mapper graph: nodes (clusters) connected when adjacent cover intervals share common points.

Implements a simplified version of the Mapper algorithm:

1. Cover the filter function range with overlapping intervals.
2. Restrict the point cloud to each interval.
3. Cluster each restriction (here: single-linkage at cluster_eps).
4. Connect clusters from adjacent intervals that share points.

Fields

nodes: Vec<MapperNode>

Nodes of the graph.

edges: Vec<(usize, usize)>

Edges between nodes: (node_i, node_j).

Implementations

impl MapperGraph

pub fn build( points: &[[f64; 2]], filter_values: &[f64], n_intervals: usize, overlap: f64, cluster_eps: f64, ) -> Self

Build a MapperGraph from a point cloud using a 1-D filter function.

Parameters

• points: 2-D point cloud.
• filter_values: scalar filter value for each point (e.g., x-coordinate).
• n_intervals: number of cover intervals.
• overlap: fractional overlap between adjacent intervals (in [0, 1)).
• cluster_eps: distance threshold for single-linkage clustering within each cover interval.

pub fn n_nodes(&self) -> usize

Number of nodes in the graph.

pub fn n_edges(&self) -> usize

Number of edges in the graph.

pub fn degree(&self, i: usize) -> usize

Degree of node i (number of edges incident to it).

pub fn total_point_count(&self) -> usize

Total number of points across all nodes (with possible duplicates from overlap).

Trait Implementations

impl Clone for MapperGraph

fn clone(&self) -> MapperGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for MapperGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for MapperGraph

fn default() -> MapperGraph

Returns the “default value” for a type.