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

use std::collections::{HashMap, HashSet};

use sinistra::graph::{
    BasicGraph, Color, GraphVertexSetMutExt, HashMapStorage, HashMapTopology, PropertyMap,
    PropertySet, VertexHandle,
};

fn any_vertex() -> sinistra::graph::VertexHandle {
    let storage = HashMapStorage::<(), ()>::new();
    let topology = HashMapTopology::new();
    let mut graph = BasicGraph::new(storage, topology);
    graph.add_vertex(())
}

#[test]
fn hashset_visit_map_marks_vertices() {
    let mut visited = HashSet::<VertexHandle>::new();
    let v = any_vertex();

    assert!(visited.mark(v, true));
    assert!(!visited.mark(v, true));
    assert!(visited.check(&v));
}

#[test]
fn hashmap_color_map_defaults_to_white() {
    let mut colors = HashMap::<VertexHandle, Color>::new();
    let v = any_vertex();

    assert_eq!(
        colors.get_property(&v).unwrap_or(&Color::White),
        &Color::White
    );
    colors.set_property(v, Color::Gray);
    assert_eq!(colors.get_property(&v), Some(&Color::Gray));
}