Definitions from Wiktionary (Canadian traveller problem)

▸ 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).


▸ Words similar to Canadian traveller problem
▸ Usage examples for Canadian traveller problem

▸ Idioms related to Canadian traveller problem
▸ Wikipedia articles (New!)
▸ Words that often appear near Canadian traveller problem
▸ Rhymes of Canadian traveller problem

▸ Invented words related to Canadian traveller problem