Jump to content

Graph exploration algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CesarB (talk | contribs) at 02:49, 5 March 2005 ({{comp-stub}}; Category:Algorithms). 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.

Stub icon

This computing article is a stub. You can help Wikipedia by expanding it.

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