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

use graph_api_lib::{EdgeSearch, Graph, 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>,
{
    // Get at most 2 vertices from the graph
    let vertices = graph
        .walk()
        .vertices(VertexSearch::scan())
        .take(2) // Only process two vertices, regardless of how many exist
        .collect::<Vec<_>>();

    // Verify we got at most 2 vertices
    assert!(vertices.len() <= 2);
    println!("Retrieved {} vertices (limited to 2)", vertices.len());
}

fn edge_example<G>(graph: &G, start_id: G::VertexId)
where
    G: Graph<Vertex = Vertex, Edge = Edge>,
{
    // Get at most 3 edges connected to a specific vertex
    let connections = graph
        .walk()
        .vertices_by_id(vec![start_id])
        .edges(EdgeSearch::scan())
        .take(3) // Only process three edges, even if there are more
        .collect::<Vec<_>>();

    // Verify we got at most 3 edges
    println!("Retrieved {} connections (limited to 3)", connections.len());
}