sinistra 0.1.0-202603071957

A generic graph framework with pluggable storage and topology and streaming graph 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

mod hash_map;
mod vec;

pub use hash_map::HashMapStorage;
pub use vec::VecStorage;

use crate::graph::{EdgeHandle, VertexHandle};

pub trait Storage {
    type Vertex;
    type Edge;

    fn vertex(&self, handle: VertexHandle) -> Option<&Self::Vertex>;
    fn edge(&self, handle: EdgeHandle) -> Option<&Self::Edge>;
}

pub trait StorageMut: Storage {
    fn vertex_mut(&mut self, handle: VertexHandle) -> Option<&mut Self::Vertex>;
    fn edge_mut(&mut self, handle: EdgeHandle) -> Option<&mut Self::Edge>;
    fn add_vertex(&mut self, vertex: Self::Vertex) -> VertexHandle;
    fn add_edge(&mut self, edge: Self::Edge) -> EdgeHandle;
    fn set_vertex(&mut self, handle: VertexHandle, vertex: Self::Vertex) -> Option<Self::Vertex>;
    fn set_edge(&mut self, handle: EdgeHandle, edge: Self::Edge) -> Option<Self::Edge>;
    fn remove_vertex(&mut self, handle: VertexHandle) -> Option<Self::Vertex>;
    fn remove_edge(&mut self, handle: EdgeHandle) -> Option<Self::Edge>;
}