breadth first search:
BFS(G, s) {
initialize vertices;
Q = {s}; // Q is a queue (duh); initialize to s
while (Q not empty) {
u = RemoveTop(Q);
for each v  u-adj {
if (v-color == WHITE)
v-color = GREY;
v-d = u-d + 1;
v-p = u;
Enqueue(Q, v);
}
u-color = BLACK;
}
}

Question

breadth first search: 
BFS(G, s) {
    initialize vertices;
    Q = {s};		// Q is a queue (duh); initialize to s
    while (Q not empty) {    
        u = RemoveTop(Q);
        for each v  u->adj {
            if (v->color == WHITE)
                v->color = GREY;
                v->d = u->d + 1;
                v->p = u;
                Enqueue(Q, v);
        }
        u->color = BLACK;
    }
}

anonymous · Answer

@rebeccaskell94 here is one algorithm :)

anonymous · Answer

nice implication.. you can also try it with 2d arrays ;)

anonymous · Answer

yes i know but it'll be tough and besides its just an algorithm :)

anonymous · Answer

yeahp, but from my experience, i found it much easier when i tried to represent graphs as 2d arrays...