Translate this to java from JavaScript please

Function shortestPathDijkstra(GRAPHS) {//var G = GRAPHS.mazeB(); var G = GRAPHS.graph_fig_9_20();//G.print(); return; var sNode;//source node number while (sNode=G.nnum || sNode81!==0) {sNode = Number(prompt("source node? (int 0 to "+(G.nnum-1)+*)?"));} var edge, n, ob;//temps var pq = makePriorityQueue();//priority queue for best performance var pLen; for (var i=0; i 0) {//process the min node on the heap ob = pq.getMin(); pq.delMin(); n = ob.val; if (G.nodes(n).handled) {continue;}//might be in pq from earlier pathlength G.nodes(n).handled = true; edge = G.nodes(n).adj;//deal with out edge nodes if any while (edge!==null) {if (!G.nodes(edge.tn).handled) {//dont process if we have already done it pLen = G.nodes(n).dist + edge.weight; if (pLen