Problem 1697 · Hard

Checking Existence of Edge Length Limited Paths

For each query, decide whether two nodes are connected using only edges shorter than the query limit. The visual sorts edges and queries by limit and merges components as the limit grows.

Open the interactive visualisation