Struct Graph 

pub struct Graph<V, D: DirectedType> { /* private fields */ }

A graph data structure supporting both directed and undirected graphs.

Type Parameters

• V - The type of vertex identifiers
• D - The directedness type (Directed or Undirected)

Examples

use std::collections::HashSet;

let mut vertices = HashSet::new();
vertices.insert(1);
vertices.insert(2);

let mut edges = HashSet::new();
edges.insert((1, 2));

let graph = Graph::<usize, Undirected>::new(vertices, edges);

Implementations

impl<V: PartialOrd + Eq + Hash> Graph<V, Undirected>

pub fn new(vertices: HashSet<V>, edges: HashSet<(V, V)>) -> Self

Creates a new graph with the given vertices and edges.

For undirected graphs, edges are normalized so that the smaller vertex (by PartialOrd) is always first in the pair.

Arguments

• vertices - The set of vertices in the graph
• edges - The set of edges in the graph

Panics

• If any edge references a vertex not in the vertex set

impl<V: PartialOrd + Eq + Hash> Graph<V, Directed>

pub fn new(vertices: HashSet<V>, edges: HashSet<(V, V)>) -> Self

Creates a new graph with the given vertices and edges.

For undirected graphs, edges are normalized so that the smaller vertex (by PartialOrd) is always first in the pair.

Arguments

• vertices - The set of vertices in the graph
• edges - The set of edges in the graph

Panics

• If any edge references a vertex not in the vertex set

Trait Implementations

impl<V: Clone, D: Clone + DirectedType> Clone for Graph<V, D>

fn clone(&self) -> Graph<V, D>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: PartialOrd + Eq + Hash + Clone> Collection for Graph<V, Directed>

type Item = VertexOrEdge<V>

The type of elements stored in the collection.

fn is_empty(&self) -> bool

Determines if the collection is empty.

fn contains(&self, point: &Self::Item) -> bool

Checks if an item is present in the collection.

impl<V: PartialOrd + Eq + Hash + Clone> Collection for Graph<V, Undirected>

type Item = VertexOrEdge<V>

The type of elements stored in the collection.

fn is_empty(&self) -> bool

Determines if the collection is empty.

fn contains(&self, point: &Self::Item) -> bool

Checks if an item is present in the collection.

impl<V: Debug, D: Debug + DirectedType> Debug for Graph<V, D>

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

Formats the value using the given formatter.