Google HR Screen Interview: Graph Theory Problem with Shortest Path Queries

An interview experience at Google involving a graph theory problem using Dijkstra's algorithm to find the maximum cities visited within time constraints on shortest paths.