Struct DirectedGraph

pub struct DirectedGraph { /* private fields */ }

Implementation of an adjacency-list based unweighted directed graph

use algods::graph::DirectedGraph;
let mut graph = DirectedGraph::init(3);
graph.add_edge(0,1);
graph.add_edge(1,2);
assert_eq!(graph.nb_vertices(), 3);
assert_eq!(graph.nb_edges(), 2);
graph.add_vertex();
assert_eq!(graph.nb_vertices(), 4);

Implementations

impl DirectedGraph

pub fn new() -> Self

Creates a new empty graph.

pub fn init(nb_objects: usize) -> Self

Creates a new graph with unconnected nb_objects objects

pub fn reverse(&self) -> Self

Creates a new graph which has the same vertices but edges reverted.

pub fn from_file<P>(filename: P, sep: char, nb_vertices: usize) -> Self

where P: AsRef<Path>,

Creates a graph from a file

pub fn nb_edges(&self) -> usize

Gives the number of edges

pub fn nb_vertices(&self) -> usize

Gives the number of vertices

pub fn add_edge(&mut self, v: usize, w: usize)

Adds a new edge o the graph

pub fn add_vertex(&mut self)

Adds a new vertex to the graph

pub fn vertex_edges(&self, v: &usize) -> Vec<&usize>

Returns an immutable reference to the set of edges

pub fn out_edges(&self, v: &usize) -> &HashSet<DirectedEdge>

pub fn in_edges(&self, v: &usize) -> &HashSet<usize>

pub fn out_degree(&self, v: &usize) -> usize

Gives the number of vertices a vertex point to

pub fn in_degree(&self, v: &usize) -> usize

Gives the number of vertices pointing to a vertex

pub fn average_degree(&self) -> usize

Gives the integer part of the average number of edges per vertex

pub fn self_loop_number(&self) -> usize

Returns the number of vertices pointing to themselves

Trait Implementations

impl Default for DirectedGraph

fn default() -> Self

Returns the “default value” for a type.

impl VertexInfo for DirectedGraph

fn vertex_edges(&self, v: &usize) -> Vec<&usize>

fn nb_vertices(&self) -> usize