Reachable Nodes In Subdivided Graph

Count how many nodes (both original and the cnt intermediate nodes that subdivide each edge) are reachable from node 0 within maxMoves in an implicitly expanded graph where each edge of the original graph becomes a path of length cnt+1. The core challenge is handling the huge implicit expansion efficiently by treating edges as weighted segments and using shortest-path distances (e.g., Dijkstra on the compressed graph) to determine which original nodes are reachable and how many subdivided nodes on each edge can be reached.