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

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

//! uni.algo.maxMatching procedure implementation.

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

pub struct MaxMatchingAdapter;

impl GraphAlgoAdapter for MaxMatchingAdapter {
    const NAME: &'static str = "uni.algo.maxMatching";
    type Algo = MaximumMatching;

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

    fn yields() -> Vec<(&'static str, ValueType)> {
        vec![
            ("node1", ValueType::Node),
            ("node2", ValueType::Node),
            ("matchId", ValueType::Int),
        ]
    }

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

    fn map_result(result: <Self::Algo as Algorithm>::Result) -> Result<Vec<AlgoResultRow>> {
        match result {
            Ok(res) => Ok(res
                .matching
                .into_iter()
                .map(|(u, v)| AlgoResultRow {
                    values: vec![json!(u.as_u64()), json!(v.as_u64()), json!(0)],
                })
                .collect()),
            Err(e) => Err(anyhow!("MaxMatching error: {}", e)),
        }
    }

    fn include_reverse() -> bool {
        true
    }
}

pub type MaxMatchingProcedure = GenericAlgoProcedure<MaxMatchingAdapter>;