Graph exploration algorithm

From Wikipedia, the free encyclopedia

You have new messages (last change).

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.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../g/r/a/Graph_exploration_algorithm.html"