12345678910111213141516171819202122double findmin(vector & graph) { vector dist(graph.size(), 999999999); priority_queue q; dist[0] = 1; q.push(pair(1, 0)); while (q.size() != 0) { int curr = q.top().second; double currd = q.top().first; q.pop(); if (currd > dist[curr]) continue; // check adjacent elements for (int i = 0; i currd*nd) { dist[n] = currd * nd; q.push(pair(dist[n], n)); } } } return..