js-graph-algorithms/test/ford-fulkerson-spec.js

Package implements data structures and algorithms for processing various types of graphs

var expect = require('chai').expect;
var jsgraphs = require('../src/jsgraphs');

describe('MaxFlow-MinCut', function(){
   it('should work', function(){
        var g = new jsgraphs.FlowNetwork(8);
        g.addEdge(new jsgraphs.FlowEdge(0, 1, 10));
        g.addEdge(new jsgraphs.FlowEdge(0, 2, 5));
        g.addEdge(new jsgraphs.FlowEdge(0, 3, 15));
        g.addEdge(new jsgraphs.FlowEdge(1, 4, 9));
        g.addEdge(new jsgraphs.FlowEdge(1, 5, 15));
        g.addEdge(new jsgraphs.FlowEdge(1, 2, 4));
        g.addEdge(new jsgraphs.FlowEdge(2, 5, 8));
        g.addEdge(new jsgraphs.FlowEdge(2, 3, 4));
        g.addEdge(new jsgraphs.FlowEdge(3, 6, 16));
        g.addEdge(new jsgraphs.FlowEdge(4, 5, 15));
        g.addEdge(new jsgraphs.FlowEdge(4, 7, 10));
        g.addEdge(new jsgraphs.FlowEdge(5, 7, 10));
        g.addEdge(new jsgraphs.FlowEdge(5, 6, 15));
        g.addEdge(new jsgraphs.FlowEdge(6, 2, 6));
        g.addEdge(new jsgraphs.FlowEdge(6, 7, 10)); 
       
        g.node(2).label = 'Hello';
        g.edge(0, 1).label = 'World';
       
        var source = 0;
        var target = 7;
        var ff = new jsgraphs.FordFulkerson(g, source, target);
        console.log('max-flow: ' + ff.value);
        expect(ff.value).to.equal(28);
       
        var minCut = ff.minCut(g);
       
        for(var i = 0; i < minCut.length; ++i) {
            var e = minCut[i];
            console.log('min-cut: (' + e.from() + ", " + e.to() + ')');
        }
        
   });
});