Graph traversal: Difference between revisions

Revision as of 02:51, 8 August 2022

Revision as of 23:04, 27 February 2023

Line 2:

{{Short description|Computer science algorithm}}

{{refimprove|date=October 2014}}

{{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.

Line 95 ⟶ 94:

==References==

{{reflist}}

{{Graph traversal algorithms}}

[[Category:Graph algorithms]]