递归不会停止

我正在编写使用 DFS 算法在图中查找周期的代码。然而，当我去打印循环的路径时，发生了一些非常奇怪的事情。在评论中阅读我的担忧。

#include <iostream> 
#include "graph.h" 
#include <stdio.h>
using namespace std;
int discovered[MAXV+1];
int parent[MAXV+1];
//Printing path that contains the cycle 
void find_path(int start, int end)
{
    int s = start;
    int e = end;
    while(s != e)
    {
        cout<<s<<" ";
        s = parent[s];
    }
/*The loop above does not stops ; 
  which means the condition parent[s] == e ;
  does not meet . However , on printing out the 
  values of s , parent[s] , and e , on successive iteration 
  I can see that the value of parent[s] and e becomes
  equal after a certain time , even though the loop does not 
  terminate.
*/
}
void dfs(graph *g , int start)
{    
    int dis = 1;
    int u = 0 ;
    edgenode *p;
    p = g->edges[start]; 
    discovered[start] = dis;
    while(p!= NULL)
    {
        u = p->y;
        parent[u] = start;
        if(discovered[u]== 1){ cout<<"Cycle"<<start<<u<<endl; find_path(start,u);}
        else dfs(g,u);
        p = p->next;
    }
    discovered[start] = dis +1;
    printf("n");   
}
int main()
{
    for(int i= 1; i<=MAXV+1; i++)
    {
        discovered[i] = false;
        parent[i] = -1;
    }
    graph *g = new graph();
    read_graph(g,true);
    dfs(g,1);
}

逻辑调用上述递归是否有缺陷，或者我的g++编译器行为怪异。任何细读我的代码将不胜感激。谢谢。

P.S：你可以假设我已经实现了一个图结构，我在编译时合并了它。我假设您对BFS算法的实现有一个很好的了解。如果您对理解代码有任何顾虑，请告诉我。