Can I use Prim's algorithm instead of Dijkstra's to find shortest path?...

Why doesn't this fortran code work?...