Skip to content

Javascript implementation of flownetwork algorithms for finding max flow in a flow network

License

Notifications You must be signed in to change notification settings

orcaman/flownetwork

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Flownetwork Circle CI

Javascript implementation of flownetwork algorithms for finding max flow in a flow network

Live Demos

Usage

Find maximum flow in a network

	// construct a network
	var fn = new FlowNetwork();
	fn.addEdge('s','o',3);
	fn.addEdge('s','p',3);
	fn.addEdge('o','p',2);
	fn.addEdge('o','q',3);
	fn.addEdge('p','r',2);
	fn.addEdge('r','t',3);
	fn.addEdge('q','r',4);
	fn.addEdge('q','t',2);	

	// find max flow
	var max = fn.maxFlow('s','t');

Find maximum flow with minimum cost in a unit graph

	// construct a network
	var fn = new FlowNetwork();
	fn.addEdge('s','o',1, 1);
	fn.addEdge('s','p',1, 2);
	fn.addEdge('o','p',1, 0);
	fn.addEdge('o','q',1, 1);
	fn.addEdge('p','r',1, 2);
	fn.addEdge('r','t',1, 0);
	fn.addEdge('q','r',1, 3);
	fn.addEdge('q','t',1, 1);

	// find max flow
	var res = fn.MFCUnitGraph('s','t');
	var flow = res.flow;
	var cost = res.cost;

Examples

License

MIT (see license file)

About

Javascript implementation of flownetwork algorithms for finding max flow in a flow network

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published