Блог пользователя thatsme123

Автор thatsme123, история, 3 года назад, По-английски

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

  • Проголосовать: нравится
  • -13
  • Проголосовать: не нравится