Computing (FOLDOC) dictionary
Jump to user comments
A graph search algorithm
which extends the
Depth-first search may fail to find a solution if it enters a
cycle in the graph. This can be avoided if we never extend a
path to a node which it already contains.