Maximum (Max) Flow is one of the problems in the family of problems involving flow in networks.In Max Flow problem, we aim to find the maximum flow from a particular source vertex s to a particular sink vertex t in a weighted directed graph G.There are several algorithms for finding the maximum flow including Ford Fulkerson's method, Edmonds Karp's algorithm, and Dinic's algorithm (there are others, but not included in this visualization yet).The dual problem of Max Flow is Min Cut, i.e. by finding the max s-t flow of G, we also simultaneously find the min s-t cut of G, i.e. the set of edges with minimum weight that have to be removed from G so that there is no path from s to t in G.

MobX connector to Angular. Contribute to mobxjs/mobx-angular development by creating an account on GitHub.

A simple facebook/linkedin lookalike chat module for Angular applications.