Revision as of 23:34, 26 December 2017 edit Netzwerkerin (talk \| contribs) 86 edits →Graph traversal algorithms: added a nice visual of three algorithms to traverse a graph. ← Previous edit		Revision as of 21:07, 29 December 2017 edit undo Ashingeorge (talk \| contribs) 28 edits m →Corrected grammar/typo Next edit →
Line 47: ====Pseudocode==== * ''Input'': A graph ''G'' and a vertex ''v'' of ''G''. * ''Output'': The closest vertex to ''v'' satisfying some conditions, or null if no such a vertex exists. 1 '''procedure''' BFS(''G'', ''v''):

Graph traversal: Difference between revisions