implement dijkstra's algorithm with this psuedocode in java while taking in an input file!

I already have a reader method that can parse the file but I NEED the dijkstra's algorithm!

the pseudo code that we're using to model dijkstra's algorithm is this:

and the input file we have to pull in is this one:

the first line is number of vertexes- so 8

the second is number of edges- so 15

and the other lines are organized at vertex 1, vertex 2, and weight

Here's a reader method I made for the file:

public Graph(BufferedReader reader) throws IOException

{

String line;

line = reader.readLine();

V = Integer.parseInt(line);

line = reader.readLine();

E = Integer.parseInt(line);

adj = new LinkedList[V];

for (int v = 0; v

adj[v] = new LinkedList();

}

while ((line = reader.readLine()) != null) {

int tempV1, tempV2;

double tempWeight;

StringTokenizer st = new StringTokenizer(line, " ");

tempV1 = Integer.parseInt(st.nextToken());

tempV2 = Integer.parseInt(st.nextToken());

tempWeight = Double.parseDouble(st.nextToken());

addEdge(tempV1, tempV2, tempWeight);

}

}

DIJKSTRA(G, u,s) INITIAL1ZH-SINGLK-SOURCH (G,) 4 while Q S-EXTRACT-MIN Q 7 or each vertex ve G.Ad RELAX(,vw RELAX(u, v, w) initialise single sourcel Graph g, Node for each vertex v in Verticesa div] := infinity