Graph traversal: Difference between revisions

Revision as of 10:05, 21 March 2019

Revision as of 10:24, 21 March 2019

Line 53:

3 enqueue ''v'' onto ''Q''

4 mark ''v''

5 '''while''' ''Q'' is not empty: '''do'''

6 ''tw'' ← ''Q''.dequeue()

7 '''if''' ''tw'' is what we are looking for: '''then'''

8 return ''tw''

9 '''for all''' edges ''e'' in ''G''.adjacentEdges(''tw'') '''do'''

12 ''ox'' ← ''G''.adjacentVertex(''tw'', ''e'')

13 '''if''' ''ox'' is not marked: '''then'''

14 mark ''ox''

15 enqueue ''ox'' onto ''Q''

16 return null