Struct UndirectedGraph 

pub struct UndirectedGraph { /* private fields */ }

Undirected weighted graph for hardware topology and routing

Implementations

impl UndirectedGraph

pub fn new(num_nodes: usize) -> Self

Create a new empty undirected graph with num_nodes nodes

pub fn add_edge(&mut self, u: usize, v: usize, weight: f64)

Add an undirected edge between u and v with the given weight

pub fn num_nodes(&self) -> usize

Return the number of nodes in the graph

pub fn bfs(&self, start: usize) -> Vec<usize>

BFS traversal from start. Returns visited nodes in BFS order.

pub fn dfs(&self, start: usize) -> Vec<usize>

DFS traversal from start. Returns visited nodes in DFS order.

pub fn dijkstra_distances(&self, source: usize) -> HashMap<usize, f64>

Dijkstra shortest path from source to all other nodes.

Returns a HashMap<usize, f64> mapping node index to minimum distance. Unreachable nodes are absent from the map.

Weights are scaled to u64 (multiplied by 1e9) for use in the binary heap, which requires Ord. This gives nanosecond precision and avoids pulling in an ordered_float dependency.

pub fn dijkstra_path( &self, source: usize, target: usize, ) -> Option<(f64, Vec<usize>)>

Dijkstra shortest path from source to target.

Returns Some((distance, path)) or None if unreachable.

Trait Implementations

impl Clone for UndirectedGraph

fn clone(&self) -> UndirectedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UndirectedGraph

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

Formats the value using the given formatter.