Question

have a look at the code below once and help me out by clarifying my doubts.
I have commented my doubts on each lines where i have doubts. Moreover, its a part of code from a huge one. so please ignore the variable declarations and all.

The whole code is working perfect and no errors while compiled.

double Graph::Dijkstra( path_t& path )
{
    int* paths = new int[_size];
    double min = dijkstra(paths); // **is a function call or not? bcz i didn't found any function in the code**
   if(min < 0) { delete[] paths; return -1;}


    int i = _size - 1;  
    while(i>=0)
    {       
        path.push(i);   // **when will the program come out of this while loop, i'm wondering how does it breaks?** 
        i=paths[i];         
    }

    path.push(0); 

    delete[] paths;
    return min;
}

Full coding is available here.

Answer 1

 double min = dijkstra(paths); // **is a function call or not? bcz i didn't found any function in the code**

It almost certainly is. However, it could be a free function, member function, function invoked by a macro, or something else. Without seeing the rest of the code, we can only guess.

while(i>=0)
{       
    path.push(i);   // **when will the program come out of this while loop, i'm wondering how does it breaks?** 
    i=paths[i];         
}

The program will come out of the loop as a soon as i is less than zero. If I had to guess, I’d say the each node in the path contains a link to the previous node’s index with the last node in a path returning -1 or some other negative number.