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
27

use crate::graph::{
    EdgeHandle, VertexHandle,
    topology::{NeighborTopology, VertexSetMut},
};

pub trait EdgeTopology: NeighborTopology {
    type Edges<'a>: Iterator<Item = EdgeHandle>
    where
        Self: 'a;

    type OutEdges<'a>: Iterator<Item = EdgeHandle>
    where
        Self: 'a;

    type InEdges<'a>: Iterator<Item = EdgeHandle>
    where
        Self: 'a;

    fn edges(&self) -> Self::Edges<'_>;
    fn out_edges(&self, v: VertexHandle) -> Self::OutEdges<'_>;
    fn in_edges(&self, v: VertexHandle) -> Self::InEdges<'_>;
}

pub trait EdgeTopologyMut: EdgeTopology + VertexSetMut {
    fn add_edge(&mut self, handle: EdgeHandle, source: VertexHandle, target: VertexHandle) -> bool;
    fn remove_edge(&mut self, handle: EdgeHandle) -> bool;
}