js-graph-algorithms
Version:
Package implements data structures and algorithms for processing various types of graphs
106 lines (93 loc) • 4.34 kB
HTML
<html>
<head>
<title>
MaxFlow-MinCut (Ford-Fulkerson)
</title>
<script src="../third-party-libs/vis/vis.js" type="text/javascript"></script>
<script src="../src/jsgraphs.js" type="text/javascript"></script>
<link href="../third-party-libs/vis/vis.css" type="text/css" />
</head>
<body>
<h2>MaxFlow-MinCut (Ford-Fulkerson)</h2>
<div id="mynetwork"></div>
<script type="text/javascript">
(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));
var source = 0;
var target = 7;
var ff = new jsgraphs.FordFulkerson(g, source, target);
console.log('max-flow: ' + ff.value);
var minCut = ff.minCut(g);
var g_nodes = [];
var g_edges = [];
for(var v=0; v < g.V; ++v){
g.node(v).label = 'Node ' + v; // assigned 'Node {v}' as label for node v
if(v == source) g.node(v).label = 'Source ' + v;
if(v == target) g.node(v).label = 'Target ' + v;
g_nodes.push({
id: v,
label: g.node(v).label,
group: (v == source || v == target ? 2 : 5)
});
}
for(var i = 0; i < minCut.length; ++i) {
var e = minCut[i];
e.highlighted = true;
console.log('min-cut: (' + e.from() + ", " + e.to() + ')');
var v = e.from();
var w = e.to();
g_edges.push({
from: v,
to: w,
label: '' + e.flow + '/' + e.capacity,
arrows:'to',
color: '#ff0000'
});
}
for(var v = 0; v < g.V; ++v) {
var adj_v = g.adj(v);
for(var i = 0; i < adj_v.length; ++i) {
var e = adj_v[i];
var w = e.other(v);
if(w != e.to()) continue;
if(e.highlighted) continue;
g_edges.push({
from: v,
to: w,
label: '' + e.flow + '/' + e.capacity,
arrows:'to'
});
};
}
console.log(g.V); // display 6, which is the number of vertices in g
console.log(g.adj(0)); // display [5, 1, 2], which is the adjacent list to vertex 0
var nodes = new vis.DataSet(g_nodes);
// create an array with edges
var edges = new vis.DataSet(g_edges);
// create a network
var container = document.getElementById('mynetwork');
var data = {
nodes: nodes,
edges: edges
};
var options = {};
var network = new vis.Network(container, data, options);
})();
</script>
</body>
</html>