Canadian traveller problem noun1 •A generalization of the shortest path problem to graphs that are only partially observable (i.e. the graph is revealed while it is being explored).
