uni-algo 0.1.5

Graph algorithms for Uni - PageRank, Louvain, shortest paths, and more
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

// SPDX-License-Identifier: Apache-2.0
// Copyright 2024-2026 Dragonscale Team

//! uni.algo.maximalCliques procedure implementation.

use crate::algo::algorithms::{Algorithm, MaximalCliques, MaximalCliquesConfig};
use crate::algo::procedure_template::{GenericAlgoProcedure, GraphAlgoAdapter};
use crate::algo::procedures::{AlgoResultRow, ValueType};
use anyhow::Result;
use serde_json::{Value, json};

pub struct MaximalCliquesAdapter;

impl GraphAlgoAdapter for MaximalCliquesAdapter {
    const NAME: &'static str = "uni.algo.maximalCliques";
    type Algo = MaximalCliques;

    fn specific_args() -> Vec<(&'static str, ValueType, Option<Value>)> {
        vec![("minSize", ValueType::Int, Some(json!(2)))]
    }

    fn yields() -> Vec<(&'static str, ValueType)> {
        vec![("clique", ValueType::List)]
    }

    fn to_config(args: Vec<Value>) -> MaximalCliquesConfig {
        MaximalCliquesConfig {
            min_size: args[0].as_u64().unwrap_or(2) as usize,
        }
    }

    fn map_result(result: <Self::Algo as Algorithm>::Result) -> Result<Vec<AlgoResultRow>> {
        Ok(result
            .cliques
            .into_iter()
            .map(|clique| {
                let clique_json: Vec<Value> =
                    clique.into_iter().map(|v| json!(v.as_u64())).collect();
                AlgoResultRow {
                    values: vec![Value::Array(clique_json)],
                }
            })
            .collect())
    }

    fn include_reverse() -> bool {
        true
    }
}

pub type MaximalCliquesProcedure = GenericAlgoProcedure<MaximalCliquesAdapter>;