Graph traversal
From Wikipedia, the free encyclopedia
Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Tree traversal is a special case of graph traversal. In contrast to tree traversal, in general graph traversal, each node may have to be visited more than once, and a root-like node that connects to all other nodes might not exist. Image:Encoder Disc (3-Bit).svg This combinatorics-related article is a stub. You can help Wikipedia by expanding it.
|
