Jump to content

Graph exploration algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 17:21, 26 April 2004 (fmt). 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_(data_structure) can be traversed.

The two most common algorithms are Breadth_first_search and Depth_first_search.

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