Struct UndirectedGraph 

pub struct UndirectedGraph { /* private fields */ }

无向图

Implementations

impl UndirectedGraph

pub fn new() -> Self

pub fn add_node(&mut self, node: NodeId)

pub fn add_edge(&mut self, from: NodeId, to: NodeId, weight: Weight)

pub fn add_edge_unweighted(&mut self, from: NodeId, to: NodeId)

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

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

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

pub fn connected_components(&self) -> Vec<Vec<NodeId>>

pub fn has_node(&self, node: NodeId) -> bool

pub fn has_edge(&self, from: NodeId, to: NodeId) -> bool

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

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.

impl Default for UndirectedGraph

fn default() -> UndirectedGraph

Returns the “default value” for a type.