Printing off the Path in an Adjacency Matrix (Pacman)

list<int> Level::planPathBFS(short currentX, short currentY, short goalX, short goalY, short debugMode)
{
        /*
        Each node in the graph has an index.
        For and given x and y position this can be found b calling index(x,y) e.g.
        goalIndex = index(goalX, goalY); 
        This function returns a path, a linked list of nodes, give a route through the map e.g.
        <555, 554, 553, 552, 551> 
        This path is contructed using a breadth first approach.
        The initial node is added to possible path list.
        This possible papth list is added to a second list, the list of possible paths.
        So after initialisation this list of possible paths only has one element,
        a list containing the current nodes index:
        <<555>> 
        This list is then expanded as follows:
                For each element in the list:
                        Take the tail of the list as the current node
                        Check for connections from this node to other nodes (using the adjacency matrix)
                        If there is a connection
                                Add a new path to the list consisting of the current path + the (other) new node
                                Check if this new is the goal node, if so return the current path
                        End 
        Should look something like this:
        Start node is 555
        Goal node is 552 
        <<555>>
        <<555,554>,<555,556>>
        <<555,554,553>,<555,554,555>,<555,556,555>,<555,556,557>>
        <<555,554,553,552>,... goal found to return path: <555,554,553,552>
                                 
        */
        list<int> path; // Final path to be constructed
        list<list<int>> pathTree; // BFS tree
        list<list<int>> pathTreeTmp; // BFS tree - used in working
        list<int> ppath;// Partial path used in BSF tree construction 
        list<list<int>>::iterator ptIter; // Iterator used for looping through the list of partial paths 
        int goalIndex; // Index of the goal node
        int currentIndex; // Index of the current node
        int otherIndex; // Index of a second node
        bool goalFound = false; // Has the goal been found? 
        goalIndex = index(goalX, goalY); // Set the goal index
        currentIndex = index(currentX, currentY); // Set the index of the current node 
        ppath.push_front(currentIndex); // Add the current index to a partial path
        pathTree.push_front(ppath); // Add that partial path to the list of partial paths 
        while (!goalFound) // Until we find the goal node
        {
                // Loop through the partial paths
                for(ptIter=pathTree.begin();ptIter != pathTree.end(); ++ptIter)
                {
                        ppath = *ptIter; // Take the next partial path
                        currentIndex = ppath.back(); // Find the index of the current node, the last node in the curretn partial path 
                        // Look in the adjacency matrix for connections to other nodes
                        for(otherIndex = 0; otherIndex < nNodes; otherIndex++)
                        {
                                // Check for a connection
                                if(adjacencyMatrix[currentIndex][otherIndex])
                                {
                                        // If so make a new partial path which is equal to the current path
                                        list<int> ppathTmp = ppath;
                                        // Add the index of the new node to the end of the path
                                        ppathTmp.push_back(otherIndex);
                                        // Add this new partial path to the list of partial paths
                                        pathTreeTmp.push_back(ppathTmp);
                                        // If the new node is the goal node
                                        if(otherIndex == goalIndex)
                                        {
                                                goalFound = true; // Set goal found to true
                                                cout << pathTreetmp ;
                                                path = ppathTmp;  // Set the path which will be return to the current partial path
                                        }
                                }
                        }
                } 
                pathTree = pathTreeTmp; // Set the list of paths to the new list
                pathTreeTmp.erase(pathTreeTmp.begin(),pathTreeTmp.end()); // Delete everything in the new list so it's ready to be filled again
        } 
 
 
        return path; // Return the path - starts with th current node ends in the goal node
}