84 std::size_t dst = N - 1; // end of path  variable
113         get_distance(vertices[src], vertices[dst]); // estimate distance from src to dst  in shortpath()
126         if (u == dst)  in shortpath_helper()
148                         g_distance[v] + get_distance(vertices[v], vertices[dst]);  in shortpath_helper()
168 void make_path(vertex_id src, vertex_id dst, std::vector<vertex_id>& path) {  in make_path()  argument
169     vertex_id at = predecessor[dst];  in make_path()
174         path.push_back(dst);  in make_path()
178         path.push_back(dst);  in make_path()
185     make_path(src, dst, path);  in print_path()
189         if (path[i] != dst) {  in print_path()
200             if (path[i] != dst)  in print_path()
287             .arg(dst, "end", "        end of path"));  in main()
295                (int)dst,  in main()
299     if (dst >= N) {  in main()
302                    (int)dst,  in main()
305         dst = N - 1;  in main()
319             if (predecessor[dst] != N) {  in main()
324                        (int)dst);  in main()
332                        (int)dst);  in main()