snark-tool 0.4.0

snark-tool library contains structures and algorithm for (mainly) cubic graph analysis
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

use crate::graph::edge::Edge;
use crate::graph::vertex::Vertex;

pub trait Graph {
    type V: Vertex;
    type E: Edge;

    fn size(&self) -> usize;
    fn has_edge(&self, from: usize, to: usize) -> bool;

    fn add_vertex(&mut self);
    fn add_edge(&mut self, from: usize, to: usize);
    fn remove_edge(&mut self, from: usize, to: usize);

    fn remove_edges_of_vertex(&mut self, vertex_index: usize);
    fn remove_vertex(&mut self, vertex_index: usize);
    fn vertices<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::V> + 'a>;

    fn edges<'a>(&'a self) -> Box<dyn Iterator<Item = &'a Self::E> + 'a>;
    fn edges_of_vertex<'a>(&'a self, vertex: usize) -> Box<dyn Iterator<Item = &'a Self::E> + 'a>;
    fn neighbors_of_vertex(&self, vertex: usize) -> Vec<usize>;
}

pub trait GraphConstructor {
    // CONSTRUCTORS
    fn new() -> Self;
    fn with_capacity(vertices: usize, edges: usize) -> Self;
    fn with_vertices_capacity(vertices: usize) -> Self;
}