wdigraph2.cc

#include "/home/cs340/progs/16f/p10/wdigraph.h"

void wdigraph::depth_first (int u) const
{
    vector<bool> visited;
    for(int i = 0; i < size; i++)
        visited.push_back(false);

    stack<int> travel;
    travel.push(u);

    while(!travel.empty())
    {
        bool found = false;
        u = travel.top();

        if(!visited[u])
            cout << label[u];

        visited[u] = true;

        for(unsigned i = 0; i < adj_matrix[u].size(); i++)
        {
            if (adj_matrix[u][i] != 0 && !visited[i])
            {
                travel.push(i);
                found = true;
                cout << "->";
                break;
            }
        }
        if (found == false)
            travel.pop();
    }
    cout << endl;
}