A route seeking device, a route seeking method, and a program capable of determining a guide route requiring a small number of transfers of transportation means by a single route seek. In the route seeking device (20) comprising a route seeking section (24) for seeking a route from a start point to a goal with reference to a route network DB (28) consisting of nodes, links to which attribute information representing the groups to which the links belong is added, and costs. The route seeking section (24) calculates a specific upper-order bit in a link cost accumulation value memory of the link as logic '1' such that the potential at the reached node of a spreading node exceeds a potential assumed in route seek if the attribute information on the tracked link is different from that of a link spreading from the reached node when the potential at the reached node is calculated by accumulating the costs of the links along an outgoing link from the start node, and outputs the thus determined route of minimum accumulation cost as a guide route requiring the smallest number of transfers.