Maximum-Flow-of-Random-Network
An algorithm designed to find the maximum flow (using bfs) of a network flow graph which is created randomly everytime the code runs (random vertices,random edges and random capcities) and a gui of the graph generated is displayed
