Graph traversal: Difference between revisions

Revision as of 12:06, 29 January 2019

Revision as of 11:39, 4 February 2019

Line 1:

{{redirect-distinguish|Graph search|Facebook Graph Search}}

{{refimprove|date=October 2014}}

Graphs are x{{Graph search algorithm}}

In [[computer science]], '''graph traversal''' (also known as '''graph search''') refers to the process of visiting (checking and/or updating) each vertex in a [[Graph (discrete mathematics)|graph]]. Such traversals are classified by the order in which the vertices are visited. [[Tree traversal]] is a special case of graph traversal.