e/Canadian traveller problem

Information
has gloss	eng: In computer science and graph theory, the Canadian Traveller Problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path.
lexicalization	eng: Canadian traveller problem
instance of	c/Computational problems in graph theory