thatsme123's blog

By thatsme123, history, 4 weeks ago, In English

This question was asked in OA of UBER on campus...

Given a weighted undirected graph with q queries for finding the shortest distance between source to destination.

Constraints: 1e5 for nodes and edges,

Weight of edges 10e9

  • Vote: I like it
  • -13
  • Vote: I do not like it