i want the c++ language not the same code the aready written befor and run it

A-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 2199 paths and make sure that your code is practical to run this large graph