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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

use sinistra::graph::{
    BasicGraph, Graph, GraphEdgesExt, GraphEdgesMutExt, GraphEndpointsExt, GraphNeighborsExt,
    GraphVertexSetMutExt, HashMapStorage, HashMapTopology, Storage,
};

fn main() {
    type Vertex = String;
    type Edge = ();

    let storage = HashMapStorage::<Vertex, Edge>::new();
    let topology = HashMapTopology::new();
    let mut graph = BasicGraph::new(storage, topology);

    // Add some vertices
    let a = graph.add_vertex("A".into());
    let b = graph.add_vertex("B".into());
    let c = graph.add_vertex("C".into());

    // Add some edges
    graph.add_edge((), a, b); // A -> B
    graph.add_edge((), b, c); // B -> C
    graph.add_edge((), a, c); // A -> C

    println!("Vertices:");

    for vertex in graph.vertices() {
        let value = graph.storage().vertex(vertex).unwrap();
        println!("{} (v{})", value, vertex.index());
    }

    println!("\nEdges:");

    for edge in graph.edges() {
        let (u, v) = graph.edge_endpoints(edge).unwrap();
        let source = graph.storage().vertex(u).unwrap();
        let target = graph.storage().vertex(v).unwrap();
        println!("{} (v{}) -> {} (v{})", source, u.index(), target, v.index());
    }

    println!("\nOutbound Neighbors of A:");

    for neighbor in graph.out_neighbors(a) {
        let value = graph.storage().vertex(neighbor).unwrap();
        println!("{} (v{})", value, neighbor.index());
    }
}