graph-api-lib 0.2.1

Core library for the graph-api ecosystem - a flexible, type-safe API for working with in-memory graphs in Rust
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
47
48
49
50
51
52
53
54
55

use graph_api_lib::{EdgeReference, EdgeSearch, Graph, VertexReference, VertexSearch};
use graph_api_simplegraph::SimpleGraph;
use graph_api_test::{Edge, Vertex, populate_graph};

fn main() {
    let mut graph = SimpleGraph::new();
    // Populate the graph with test data
    let refs = populate_graph(&mut graph);

    vertex_example(&graph);
    edge_example(&graph, refs.bryn);
}

fn vertex_example<G>(graph: &G)
where
    G: Graph<Vertex = Vertex, Edge = Edge>,
{
    // Use probe to inspect vertices during traversal
    let mut project_count = 0;

    graph
        .walk()
        .vertices(VertexSearch::scan())
        .probe(|vertex, _| {
            // Inspect each vertex and count projects
            if let Vertex::Project(project) = vertex.weight() {
                project_count += 1;
                println!("Found project: {}", project.name);
            }
        })
        .count();

    println!("Total projects found: {}", project_count);
}

fn edge_example<G>(graph: &G, bryn_id: G::VertexId)
where
    G: Graph<Vertex = Vertex, Edge = Edge>,
{
    // Use probe to analyze edges during traversal
    graph
        .walk()
        .vertices_by_id(vec![bryn_id])
        .edges(EdgeSearch::scan())
        .probe(|edge, _| {
            // Print information about each edge without affecting traversal
            println!(
                "Found edge: {:?} connecting {:?} to {:?}",
                edge.weight(),
                graph.vertex(edge.tail()).unwrap().id(),
                graph.vertex(edge.head()).unwrap().id()
            );
        })
        .count();
}