 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
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.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
