feat : find maximum flow in a graph

updated : find maximum flow in a graph
updated name - conventions
TheAlgorithms · ayaankhan98 · May 25, 2020 · ayaankhan98 · May 25, 2020 · offamitkumar
diff --git a/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp b/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
+ * vis          -> visited node 
+ * c_n          -> current_node
+ * n            -> total number of nodes
+ * m            -> total number of edges
+ * s            -> source 
+ * t            -> sink 
diff --git a/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp b/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
+using std::min;
+using std::max;
+using std::tie;
+using std::make_tuple;
+using std::make_pair;
+// standard containers used
+using std::vector;
+using std::queue;
+using std::bitset;
+using std::tuple;
+// standard streams used
+using std::cout;
+using std::cin;
diff --git a/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp b/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
diff --git a/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp b/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp