Programming Homework Help. SU BFS(G,s) for Each Vertex U in G.V – {s} Java Programming Script Exercise
BFS(G,s)
1 for each vertex u in G.V – {s}
2 u.color = white
3 u.d = INF
4 u.p = NIL
5 s.color = green
6 s.d = 0
7 s.p = NIL
8 Q = NULL
9 ENQUEUE(Q,s)
10 while Q != NULL
11 u = DEQUEUE(Q)
12 for each v in G.Adj[u]
13 if v.color == white
14 v.color = green
15 v.d = u.d + 1
16 v.p = u
17 ENQUEUE(Q,v)
18 u.color = black
Program this in java.
