k skip shortest path.

Revision en2, by kickbust13, 2019-10-15 14:27:04

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.

Tags shortest path


  Rev. Lang. By When Δ Comment
en2 English kickbust13 2019-10-15 14:27:04 2 Tiny change: 'uestion.\nconsider' -> 'uestion.\n\nconsider'
en1 English kickbust13 2019-10-15 14:24:35 242 Initial revision (published)