k skip shortest path.

Правка en1, от kickbust13, 2019-10-15 14:24:35

can anyone help in solving the following question. consider a weighted undirected graph. There is a source S and destination D and a value K. Find the length of the shortest path such that you can make at most K edges 0.

Теги shortest path

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский kickbust13 2019-10-15 14:27:04 2 Tiny change: 'uestion.\nconsider' -> 'uestion.\n\nconsider'
en1 Английский kickbust13 2019-10-15 14:24:35 242 Initial revision (published)