Looking for the meaning or definition of the word Canadian traveller problem? Here's what it means.
Noun
(computing theory) 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).