Jump to content

Graph exploration algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 150.101.96.241 (talk) at 09:15, 29 October 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science a graph exploration algorithm specifies a possible way a graph can be traversed. The two most common algorithms are breadth-first search and depth-first search.

Stub icon

This computer science 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=26778784"