stack overflow

[eternalLearner]

hi :

my code creates a graph
vector <Node*> node_list_vector;

where

class Node
{
    public :
    int id;
    std :: vector< std :: pair<int,double> > weighted_adjacency_list;
 
    //construct the weighted graph    
    Node(int key,std :: vector < std :: pair <int,double> > list)
    {
        id = key;
        weighted_adjacency_list = list;
        node_list_vector.push_back(this);
    }
};
 
 

i have to generate all possible paths from the graph ,but i get stack overflow wen i use the following code :

 //gets all possible paths starting from all possible valid nodes
void get_all_paths()
{
 
    node_list_vector_iter = node_list_vector.begin();
 
    //call the function to generate the paths that start from the specific node
    while(node_list_vector_iter !=  node_list_vector.end())
    {
 
        temp_weighted_vect.push_back(pair<int,double> (node_id,double(0)));
        get_paths(node_id,temp_weighted_vect);
        node_list_vector_iter++;    
    }
}
 
void get_paths(int node_id,vector<pair<int,double> >path)
{
 
    if(!path.empty())
    {
        //do something 
 
    }
    else
    {    
        //error
 
    }
 
 
 
    vector<pair <int,double > > weighted_neighbours = (node_list_vector[node_id])->weighted_adjacency_list;
    vector<pair<int,double> >::iterator neighbours = weighted_neighbours.begin();
 
 
    //prints the paths wen no further outgoing edges are available
    if(((node_list_vector[node_id])->weighted_adjacency_list).empty())
    {
        return;
    }
    else
    {    
        while(neighbours != weighted_neighbours.end())
        {
            get_paths((*neighbours).first,path);
            path.pop_back();
            neighbours++;    
        }
    }
}
 

please let me know wats the problem with my code.
thanks in advance.