![]() |
|
|||||||||||||||||
Graph exploration algorithmA 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. The contents of this article are licensed from Wikipedia.org under the GNU Free Documentation License.
How to see transparent copy 01-04-2007 01:21:04 |
|





