I'm trying to solve the shortest path of Dijkstra algorithm. I know this is not right, but what should I do to make it work?

Question

I\'m looking for a way to solve the algorithm, but somehow it\'s not working. Can anybody please help me with this?

       while (nextDspNode != null) {