We are given 2 nodes s and t, and M queries that have one edge that needs to be deleted [only for this query], and for each query you need to output the shortest path between s and t. Note that s and t do not change.
1 ≤ Number of Nodes ≤ 7000
1 ≤ Number of edges ≤ 50000
1 ≤ Number of queries ≤ 10000
I couldn't find anything over the internet. I was thinking of something along the walks of pre-computation on a Dijkstra tree/Shortest path tree but couldn't think of anything. Can someone please provide hints or an approach to this problem?