graph traversal


{{Graph search algorithm}}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.{{combin-stub}}그래프 트래버설Suchverfahren#Suche_in_Graphen

home | about | policy | newsfeed