Help with Depth First Search

Code:

class arc
{
  public:
    int adj;
    int weight;
    arc(){}
    arc(int a)
    {
        adj = a;
    }
};

int bfs(int v,int n) //using queues
    {
        int i, front, rear;
        int que[20];
        front = rear =  - 1;

        cout << v;
        visited[v] = true;
        rear++;
        front++;
        que[rear] = v;

        while (front <= rear)
        {
            v = que[front];
            front++;
            for (i = 1; i <= n; i++)
            {
                if ((arcs[v][i] == 1) && (visited[i] == false)) //error line
                {
                    cout << i;
                    visited[i] = true;
                    rear++;
                    que[rear] = i;
                }
            }
        }
    }

can someone help me with my problem? please i really2x need all your help thanks advance

Since you seem to be using quite a few global variables, you will need to post the smallest possible complete program that illustrates your problem. For example how is arcs defined? How is visited defined?

Jim

You're trying to do breadth first search, not depth first.
Misleading thread title.