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 edge_topology;
mod endpoint_topology;
mod hash_map;
mod neighbor_topology;
mod undirected;
mod vertex_set;

pub use edge_topology::{EdgeTopology, EdgeTopologyMut};
pub use endpoint_topology::EndpointTopology;
pub use hash_map::HashMapTopology;
pub use neighbor_topology::NeighborTopology;
pub use undirected::Undirected;
pub use vertex_set::{VertexSet, VertexSetMut};

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

pub trait Topology: EndpointTopology {
    type Adjacent<'a>: Iterator<Item = (VertexHandle, EdgeHandle)>
    where
        Self: 'a;

    // TODO: Maybe we should default this to out_edges()?
    fn adjacent(&self, v: VertexHandle) -> Self::Adjacent<'_>;
}

pub trait TopologyMut: EdgeTopologyMut + Topology {}