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
52
53

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

//! uni.algo.mst procedure implementation.

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

pub struct MstAdapter;

impl GraphAlgoAdapter for MstAdapter {
    const NAME: &'static str = "uni.algo.mst";
    type Algo = MinimumSpanningTree;

    fn specific_args() -> Vec<(&'static str, ValueType, Option<Value>)> {
        vec![("weightProperty", ValueType::String, None)]
    }

    fn yields() -> Vec<(&'static str, ValueType)> {
        vec![
            ("source", ValueType::Node),
            ("target", ValueType::Node),
            ("weight", ValueType::Float),
        ]
    }

    fn to_config(_args: Vec<Value>) -> MstConfig {
        MstConfig {}
    }

    fn map_result(result: <Self::Algo as Algorithm>::Result) -> Result<Vec<AlgoResultRow>> {
        Ok(result
            .edges
            .into_iter()
            .map(|(u, v, w)| AlgoResultRow {
                values: vec![json!(u.as_u64()), json!(v.as_u64()), json!(w)],
            })
            .collect())
    }

    fn customize_projection(mut builder: ProjectionBuilder, args: &[Value]) -> ProjectionBuilder {
        if let Some(prop) = args[0].as_str() {
            builder = builder.weight_property(prop);
        }
        builder
    }
}

pub type MstProcedure = GenericAlgoProcedure<MstAdapter>;