Given a weighted undirected graph, you have multiple queries asking for the minimum possible maximum edge between two points. How do you solve this?
N<=100000 Q<=100000
All pairs minimax
Given a weighted undirected graph, you have multiple queries asking for the minimum possible maximum edge between two points. How do you solve this?
N<=100000 Q<=100000