uni-algo 2.1.0

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
54

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

//! uni.algo.bidirectionalDijkstra procedure implementation.

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

pub struct BidirectionalDijkstraAdapter;

impl GraphAlgoAdapter for BidirectionalDijkstraAdapter {
    const NAME: &'static str = "uni.algo.bidirectionalDijkstra";
    type Algo = BidirectionalDijkstra;

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

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

    fn to_config(args: Vec<Value>) -> Result<BidirectionalDijkstraConfig> {
        Ok(BidirectionalDijkstraConfig {
            source: parse_vid_arg(&args[0], "startNode")?,
            target: parse_vid_arg(&args[1], "endNode")?,
        })
    }

    fn map_result(result: <Self::Algo as Algorithm>::Result) -> Result<Vec<AlgoResultRow>> {
        let mut rows = Vec::new();
        if let Some(d) = result.distance {
            rows.push(AlgoResultRow {
                values: vec![json!(d)],
            });
        }
        Ok(rows)
    }

    // `include_reverse` defaults to true (this algorithm searches from both
    // ends), so only the weight-property index needs overriding.
    fn weight_arg_index() -> Option<usize> {
        Some(2)
    }
}

pub type BidirectionalDijkstraProcedure = GenericAlgoProcedure<BidirectionalDijkstraAdapter>;