digraphx-rs 0.1.1

Network Optimization Algorithms in Rust
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
55
56
57
58
59
60
61
62
63
64

use std::collections::HashMap;
use std::cmp::PartialOrd;
use std::hash::Hash;

trait ParametricAPI<Node, Edge, Ratio> {
    fn distance(&self, ratio: Ratio, edge: &Edge) -> Ratio;
    fn zero_cancel(&self, cycle: &Cycle) -> Ratio;
}

struct MaxParametricSolver<Node, Edge, Ratio, D, Cycle> {
    ncf: NegCycleFinder,
    omega: ParametricAPI<Node, Edge, Ratio>,
}

impl<Node, Edge, Ratio, D, Cycle> MaxParametricSolver<Node, Edge, Ratio, D, Cycle> {
    fn run(&self, dist: &mut HashMap<Node, D>, ratio: Ratio) -> (Ratio, Cycle) {
        // Implementation here
    }
}

fn set_default(digraph: &mut GraphMut, weight: &str, value: Domain) {
    // Implementation here
}

struct CycleRatioAPI<Node, Edge, Ratio, D> {
    digraph: HashMap<Node, HashMap<Node, HashMap<String, D>>>,
    result_type: D,
}

impl<Node, Edge, Ratio, D> CycleRatioAPI<Node, Edge, Ratio, D> {
    fn distance(&self, ratio: Ratio, edge: &mut HashMap<String, D>) -> Ratio {
        // Implementation here
    }

    fn zero_cancel(&self, cycle: &Cycle) -> Ratio {
        // Implementation here
    }
}

struct MinCycleRatioSolver<Node, Edge, Ratio> {
    digraph: Graph,
}

impl<Node, Edge, Ratio> MinCycleRatioSolver<Node, Edge, Ratio> {
    fn run(&self, dist: &mut HashMap<Node, Domain>, r0: Ratio) -> (Ratio, Cycle) {
        // Implementation here
    }
}

fn test_cycle_ratio_raw() {
    // Test implementation here
}

fn test_cycle_ratio() {
    // Test implementation here
}

fn test_cycle_ratio_timing() {
    // Test implementation here
}

fn test_cycle_ratio_tiny_graph() {
    // Test implementation here
}