Question

You're given an undirected weighted graph containing n nodes, connected with m edges. You can start walking from a node and go to any neighbouring node to the current node. And the cost of the walk will be the weight of the edge.
For each node, you need to calculate the minimum cost of the walk such that we start the walk from that node and end the walk on that node in exactly k moves.​

Answer 1

Answer:

view of the day of the year again when we want to do it and you have any questions or boy