or 64^64 seconds: time taken by a supercomputer (performing 1 iteration of the algorithm every 1ns) to solve the Longest Path Problem (LPP) between 64 cities (for the Shortest Path Problem n^2 iterations with Dijkstra’s algorithm, 1959, are sufficient)
