Science Fair Project Encyclopedia
Graph exploration algorithm
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.
03-10-2013 05:06:04
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


