Given a large network graph, describe an efficient way to identify the shortest path between two nodes while accounting for dynamic weight changes.
