Struct Graph 

pub struct Graph {
    pub node_count: usize,
    pub edges: Vec<GraphEdge>,
}

Simple sparse graph with node count and edge list

Fields

node_count: usize

edges: Vec<GraphEdge>

Implementations

impl Graph

pub fn new(node_count: usize) -> Self

Create a new empty graph with node_count nodes and no edges

pub fn add_edge(&mut self, from: usize, to: usize, weight: f32)

Add a directed edge from → to with the given weight

pub fn edge_count(&self) -> usize

Total number of edges

pub fn is_connected(&self) -> bool

BFS from node 0 to check if all nodes are reachable (i.e. graph is connected).

Treats edges as undirected for the connectivity check.

pub fn adjacency_matrix(&self) -> Vec<Vec<f32>>

Build a dense adjacency matrix (node_count × node_count).

For undirected usage the matrix is symmetric (both from→to and to→from are set).

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.