Graph

Question

Write an implementation code (using any preferred language) to find
k-shortest path from graph G using the modified Dijkstra algorithm
k-minimum spanning trees from graph G using the modified prims algorithm.

Suppose that you will have large graph which may contain 2^99 paths and make sure that your code is practical to run this large graph.

Answer 1

If you need help, it would be beneficial for you to show your attempts so that we can figure out what went wrong and rectify those mistakes.