kickbust13's blog

By kickbust13, history, 3 years ago, In English

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.

Read more »

  • Vote: I like it
  • 0
  • Vote: I do not like it