graphqlite 0.6.0

SQLite extension for graph queries using Cypher
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

//! Connected components algorithm implementations.

use super::{
    parsing::{extract_algo_array, extract_int, extract_node_id, extract_user_id},
    ComponentResult,
};
use crate::graph::Graph;
use crate::Result;

impl Graph {
    /// Find weakly connected components in the graph.
    ///
    /// Treats the graph as undirected and finds connected components.
    pub fn wcc(&self) -> Result<Vec<ComponentResult>> {
        let result = self.connection().cypher("RETURN wcc()")?;
        let rows = extract_algo_array(result.iter().collect::<Vec<_>>().as_slice());

        let mut components = Vec::new();
        for row in rows.iter() {
            if let Some(node_id) = extract_node_id(row) {
                components.push(ComponentResult {
                    node_id,
                    user_id: extract_user_id(row),
                    component: extract_int(row, "component"),
                });
            }
        }
        Ok(components)
    }

    /// Find strongly connected components in the graph.
    ///
    /// Finds maximal subgraphs where every node is reachable from every
    /// other node following edge directions. Uses Tarjan's algorithm.
    pub fn scc(&self) -> Result<Vec<ComponentResult>> {
        let result = self.connection().cypher("RETURN scc()")?;
        let rows = extract_algo_array(result.iter().collect::<Vec<_>>().as_slice());

        let mut components = Vec::new();
        for row in rows.iter() {
            if let Some(node_id) = extract_node_id(row) {
                components.push(ComponentResult {
                    node_id,
                    user_id: extract_user_id(row),
                    component: extract_int(row, "component"),
                });
            }
        }
        Ok(components)
    }
}