algods 0.1.0

A collection of data structures and algorithms
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
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

mod directed_graph;
pub mod processing;
mod undirected_graph;

pub use directed_graph::{DirectedGraph, EdgeWeightedDigraph, FlowEdge, FlowNetwork};
pub use undirected_graph::UndirectedGraph;

/// This trait gives some basic information on vertices
pub trait VertexInfo {
    // fn vertex_edges(&self, v: &usize) -> &HashSet<usize>;
    fn vertex_edges(&self, v: &usize) -> Vec<&usize>;
    fn nb_vertices(&self) -> usize;
}

// Greatly inspired by :
// https://github.com/s1ck/graph/blob/main/crates/builder/src/index.rs
pub trait Weight:
    Copy
    + std::ops::Add<Output = Self>
    + std::ops::Sub<Output = Self>
    + Ord
    + Eq
    + std::hash::Hash
    + PartialEq
    + std::fmt::Display
{
    fn zero() -> Self;
    fn max() -> Self;
}

macro_rules! impl_weight {
    ($TYPE:ty) => {
        impl Weight for $TYPE {
            fn max() -> Self {
                <$TYPE>::MAX
            }

            fn zero() -> Self {
                0 as $TYPE
            }
        }
    };
}

impl_weight!(u8);
impl_weight!(u16);
impl_weight!(u32);
impl_weight!(u64);
impl_weight!(usize);

impl_weight!(i8);
impl_weight!(i16);
impl_weight!(i32);
impl_weight!(i64);
impl_weight!(isize);