We study a pathfinding problem of directed trees under the following situation: each edge has a nonnegative integer length, but the length is unknown in advance and should be searched by a procedure whose computational cost becomes very large as the length increases. We present a method that gives a shortest path. Under some assumptions, the proposed method is optimal in the number of procedure calls for the longest edge length. This graph problem is motivated by procedure synthesis for system configuration in cloud systems.
