Leetcode 3123. Find Edges in Shortest Paths

Given an undirected weighted graph, determine for each edge whether it lies on at least one shortest path from node 0 to node n-1. This requires computing shortest distances (e.g., from source and target) and checking for each edge if using it attains the global shortest distance.