Struct wuf::Graph

pub struct Graph { /* private fields */ }

Implementations

impl Graph

pub fn new(n: usize) -> Graph

Returns a new Graph with the given number of nodes.

Arguments

• n Number of nodes belonging to the graph.

pub fn count(&self) -> usize

Returns the number of nodes.

Example

let graph = wuf::Graph::new(10);
println!("Number of nodes: {}", graph.count());

pub fn connected(&mut self, a: usize, b: usize) -> bool

Returns true only if the two given nodes are connected, otherwise returns false.

Arguments

• a ID of the first node.
• b ID of the second node.

Example

let mut graph = wuf::Graph::new(10);
let node1 = 0;
let node2 = 1;
println!("Are nodes connected? {}", graph.connected(node1, node2));

pub fn connect(&mut self, a: usize, b: usize)

Connects the two given nodes.

Arguments

• a ID of the first node.
• b ID of the second node.

Example

let mut graph = wuf::Graph::new(10);
let node1 = 0;
let node2 = 1;
graph.connect(node1, node2);