rs-graph 0.6.3

A library for graph algorithms and combinatorial optimization
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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157

// Copyright (c) 2016, 2017 Frank Fischer <frank-fischer@shadow-soft.de>
//
// This program is free software: you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation, either version 3 of the
// License, or (at your option) any later version.
//
// This program is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program.  If not, see  <http://www.gnu.org/licenses/>
//

//! All-Pairs-Shortest-Path algorithm of Floyd and Warshall.

#![cfg_attr(feature = "cargo-clippy", allow(type_complexity))]

use {IndexGraph, IndexDigraph, EdgeSlice};
use num::traits::{NumAssign, Bounded};

/**
 * Solve the All-Pairs-Shortest-Path-Problem with the algorithm of
 * Floyd and Warshall on an undirected graph.
 *
 * Returns a 2D vector with entries `(dist, pred)` for each pair of
 * nodes where `dist` is the length of the shortest path and `pred` is
 * the predecessor of the last node.
 */
pub fn undirected<'a, 'b, G, W>(g: &'a G, weights: &EdgeSlice<'a, 'b, G, W>) -> Vec<Vec<Option<(W, G::Node)>>>
    where G: IndexGraph<'a>,
          W: NumAssign + Ord + Copy + Bounded,
{
    let mut dist: Vec<Vec<Option<(W, G::Node)>>> = vec![vec![None; g.num_nodes()]; g.num_nodes()];

    for u in g.nodes() {
        dist[g.node_id(u)][g.node_id(u)] = Some((W::zero(), u));
    }

    for e in g.edges() {
        let (u, v) = g.enodes(e);
        let uid = g.node_id(u);
        let vid = g.node_id(v);
        let w = weights[e];
        if w < dist[uid][vid].map(|x| x.0).unwrap_or_else(W::max_value) {
            dist[uid][vid] = Some((w, u));
            dist[vid][uid] = Some((w, u));
        }
    }

    for k in 0..g.num_nodes() {
        for u in 0..g.num_nodes() {
            if u == k {
                continue;
            }
            if let Some(&(dist_uk, _)) = dist[u][k].as_ref() {
                for v in 0..g.num_nodes() {
                    if v == k {
                        continue;
                    }
                    if let Some(&(dist_kv, pred_kv)) = dist[k][v].as_ref() {
                        if dist[u][v].map(|x| x.0).unwrap_or_else(W::max_value) > dist_uk + dist_kv {
                            dist[u][v] = Some((dist_uk + dist_kv, pred_kv));
                        }
                    }
                }
            }
        }
    }

    dist
}

/**
 * Solve the All-Pairs-Shortest-Path-Problem with the algorithm of
 * Floyd and Warshall on a directed graph.
 *
 * Returns a 2D vector with entries `(dist, pred)` for each pair of
 * nodes where `dist` is the length of the shortest path and `pred` is
 * the predecessor of the last node.
 *
 * # Example
 * ```
 * use rs_graph::{LinkedListGraph, Builder, EdgeSlice};
 * use rs_graph::shortestpath::floydwarshall;
 *
 * let mut g = LinkedListGraph::<usize>::new();
 * let nodes = g.add_nodes(5);
 * let mut weights = vec![];
 * for &(u,v,w) in [(0,1,6), (0,2,5),
 *                  (1,2,7), (1,3,3), (1,4,-2),
 *                  (2,3,-4), (3,4,8),
 *                  (3,1,-1),
 *                  (4,0,2), (4,3,7), ].iter()
 * {
 *     g.add_edge(nodes[u], nodes[v]);
 *     weights.push(w);
 * }
 *
 * let result = floydwarshall::directed(&g, &EdgeSlice::new(&g, &weights));
 * let mut s = [[0; 5]; 5];
 * for (i,v) in result.into_iter().enumerate() {
 *     for (j,d) in v.into_iter().enumerate() {
 *         s[i][j] = d.unwrap().0;
 *     }
 * }
 * assert_eq!(s, [[ 0, 0, 5, 1,-2],
 *                [ 0, 0, 5, 1,-2],
 *                [-5,-5, 0,-4,-7],
 *                [-1,-1, 4, 0,-3],
 *                [ 2, 2, 7, 3, 0],]);
 * ```
 */
pub fn directed<'a, 'b, G, W>(g: &'a G, weights: &EdgeSlice<'a, 'b, G, W>) -> Vec<Vec<Option<(W, G::Node)>>>
    where G: IndexDigraph<'a>,
          W: NumAssign + Ord + Copy + Bounded,
{
    let mut dist: Vec<Vec<Option<(W, G::Node)>>> = vec![vec![None; g.num_nodes()]; g.num_nodes()];

    for u in g.nodes() {
        dist[g.node_id(u)][g.node_id(u)] = Some((W::zero(), u));
    }

    for e in g.edges() {
        let (u, v) = (g.src(e), g.snk(e));
        let uid = g.node_id(u);
        let vid = g.node_id(v);
        let w = weights[e];
        if w < dist[uid][vid].map(|x| x.0).unwrap_or_else(W::max_value) {
            dist[uid][vid] = Some((w, u));
        }
    }

    for k in 0..g.num_nodes() {
        for u in 0..g.num_nodes() {
            if u == k {
                continue;
            }
            if let Some(&(dist_uk, _)) = dist[u][k].as_ref() {
                for v in 0..g.num_nodes() {
                    if v == k {
                        continue;
                    }
                    if let Some(&(dist_kv, pred_kv)) = dist[k][v].as_ref() {
                        if dist[u][v].map(|x| x.0).unwrap_or_else(W::max_value) > dist_uk + dist_kv {
                            dist[u][v] = Some((dist_uk + dist_kv, pred_kv));
                        }
                    }
                }
            }
        }
    }

    dist
}