Help needed in a graph problem

Правка en2, от hardy_9795, 2020-09-15 12:02:07

We have been given a graph such that a path exists between any two given nodes.The edges have some weight assigned to them. We are given a starting node and a ending node and we required to find the minimum distance between two nodes.The distance is the sum of edge weights. We have a special power by which we can change the weights of atmost k edges, we can make their weight to be equal to zero. So given two nodes we are supposed to find the minimum distance between them using the special power atmost k times.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский hardy_9795 2020-09-15 12:02:07 26 Tiny change: 'n a graph which is basically a tree such that' -> 'n a graph such that'
en1 Английский hardy_9795 2020-09-15 10:06:30 571 Initial revision (published)