rs-graph 0.7.0

/*
 * Copyright (c) 2015, 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/>
 */

extern crate rs_graph as graph;
extern crate time;
extern crate num_traits;

#[macro_use]
extern crate rustop;

use graph::{Graph, Digraph, IndexNetwork, EdgeSlice, LinkedListGraph};
use graph::maxflow::{MaxFlow, EdmondsKarp};
use graph::dimacs::maxflow::Instance;

use std::fmt::Display;

fn run<'a, 'b, G, F>(g: &mut EdmondsKarp<'a, G, F>,
                     src: G::Node, snk: G::Node,
                     upper: &EdgeSlice<'a, 'b, G, F>,
                     niter: usize)
    where G: 'a + IndexNetwork<'a>,
          F: Display + num_traits::NumAssign + Ord + Copy,
{
    {
        let tstart = time::precise_time_ns();
        for _ in 0..niter {
            g.solve(src, snk, upper);
        }
        let tend = time::precise_time_ns();
        println!("Time: {}", (tend - tstart) as f64 / 1e9);
        println!("Flow: {}", g.value());
    }
}

fn main() {
    let (args, _) = opts! {
        synopsis "Solve max-flow problem with the algorithm of Edmonds-Karp.";
        opt num:usize=1, desc:"Number of times the algorithm is repeated.";
        param file:String, desc:"Instance file name";
    }.parse_or_exit();

    let tstart = time::precise_time_ns();
    let instance = Instance::<_, i32, _>::read(&args.file).unwrap();

    let g: LinkedListGraph = instance.graph;
    let s = instance.src;
    let t = instance.snk;
    let upper = EdgeSlice::new(&g, &instance.upper);

    let tend = time::precise_time_ns();
    println!("Time: {}", (tend - tstart) as f64 / 1e9);
    println!("  graph: LinkedListGraph");
    println!("  number of nodes: {}", g.num_nodes());
    println!("  number of arcs: {}", g.num_edges());

    let mut d = EdmondsKarp::new(&g);
    run(&mut d, s, t, &upper, args.num);

    assert!(g.edges().all(|e| d.flow(e) >= 0 && d.flow(e) <= upper[e]));
    assert!(g.nodes().filter(|&u| u != s && u != t).all(|u| {
        g.outedges(u).map(|(e,_)| d.flow(e)).sum::<i32>() == g.inedges(u).map(|(e,_)| d.flow(e)).sum::<i32>()
    }));
    assert_eq!(g.outedges(s).map(|(e,_)| d.flow(e)).sum::<i32>() -
               g.inedges(s).map(|(e,_)| d.flow(e)).sum::<i32>() ,
               d.value());
}