Help me pls with edmond algorithm

[seeplus]

As formatted using code tags etc:

#include <iostream>
#include <limits.h>
#include <string.h>
#include <queue>
using namespace std;

#define V 6

bool bfs(int rGraph[V][V], int s, int t, int parent[])
{
	bool visited[V];
	memset(visited, 0, sizeof(visited));

	queue <int> q;

	q.push(s);
	visited[s] = true;
	parent[s] = -1;

	// Standard BFS Loop
	while (!q.empty())
	{
		int u = q.front();

		q.pop();

		for (int v = 0; v < V; v++)
			if (visited[v] == false && rGraph[u][v] > 0)
			{
				q.push(v);
				parent[v] = u;
				visited[v] = true;
			}
	}

	return visited[t] == true;
}

int fordFulkerson(int graph[V][V], int s, int t)
{
	int u, v;
	int rGraph[V][V];

	for (u = 0; u < V; u++)
		for (v = 0; v < V; v++)
			rGraph[u][v] = graph[u][v];

	int parent[V];
	int max_flow = 0;

	while (bfs(rGraph, s, t, parent))
	{
		for (v = t; v != s; v = parent[v])
		{
			u = parent[v];
			path_flow = min(path_flow, rGraph[u][v]);
		}

		for (v = t; v != s; v = parent[v])
		{
			u = parent[v];
			rGraph[u][v] -= path_flow;
			rGraph[v][u] += path_flow;
		}

		max_flow += path_flow;
	}

	return max_flow;
}

Note L56, 62, 63 - path_flow has not been defined, so the program does not compile.

[newbieg]

https://www.geeksforgeeks.org/ford-fulkerson-algorithm-for-maximum-flow-problem/

The variable you need is defined in the above link.
For further studies, here's a helpful video;
https://www.youtube.com/watch?v=OViaWp9Q-Oc

It is briefly discussed in "Introduction to Algorithms" by CLRS. (Page 727 in the third edition), in which bfs and Ford Fulkerson algorithms are also explained.