Translate pseudo code to java code. Dijkstras shortest path

5 is matrix size. 2 is source/starting vertex

Dijkstra's shortest path algorithm let s be starting vertex let C be set of all vertices minus s let D[v]- dist(s, v) and P[v]s for each v E C repeat until C is empty choose v from C that has minimum D[v] value let C C -(v) for each neighbor w of v in C if Div] + dist(v, w)