Jump to content

Graph exploration algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kdau (talk | contribs) at 02:43, 1 December 2004 (fix links, substub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A graph exploration algorithm specifies a possible way how a graph can be traversed.

The two most common algorithms are breadth-first search and depth-first search.

Template:Substub

Retrieved from "https://en.wikipedia.org/w/index.php?title=Graph_exploration_algorithm&oldid=10784908"