Algorithm · Uber · Hard
An undirected graph with n vertices is represented by edgeList, where each entry edgeList[i] = [u_i, v_i, dis_i] describes an edge joining u_i and v_i whose distance is dis_i. More than one edge may connect the same pair of vertices. You are also given queries, with each item written as queries[j] = [p_j, q_j, limit_j]. For every query, decide whether p_j can reach q_j through a path for which every edge distance is strictly smaller than limit_j. Produce a boolean array…
Checking your access…