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
index 20571cdc518..e81ca38b914 100644
--- a/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
+++ b/graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
@@ -27,8 +27,7 @@ class Graph {
         visited.reset();
         std::queue<int> q;
         q.push(source);
-        bool is_path_found = false;
-        while (q.empty() == false && is_path_found == false) {
+        while (q.empty() == false) {
             int current_node = q.front();
             visited.set(current_node);
             q.pop();