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.isBipartite procedure implementation.

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

pub struct BipartiteCheckAdapter;

impl GraphAlgoAdapter for BipartiteCheckAdapter {
    const NAME: &'static str = "uni.algo.isBipartite";
    type Algo = BipartiteCheck;

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

    fn yields() -> Vec<(&'static str, ValueType)> {
        vec![
            ("isBipartite", ValueType::Bool),
            ("partition", ValueType::Map),
        ]
    }

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

    fn map_result(result: <Self::Algo as Algorithm>::Result) -> Result<Vec<AlgoResultRow>> {
        let mut partition_map = serde_json::Map::new();
        if result.is_bipartite {
            for (vid, color) in result.partition {
                partition_map.insert(vid.to_string(), json!(color));
            }
        }

        Ok(vec![AlgoResultRow {
            values: vec![json!(result.is_bipartite), Value::Object(partition_map)],
        }])
    }

    fn include_reverse() -> bool {
        true
    }
}

pub type BipartiteCheckProcedure = GenericAlgoProcedure<BipartiteCheckAdapter>;