All submissions must be written in Java

1) IDE/OS (Example: Netbeans+Linux)

2) % completness from your point of view (tell us exactly what your PROGRAM can / cannot do)

3) Citations are a must, if you looked anywhere for help

Implement DIJKSTRA's algorithm for Single Source Shortest Path Problem with BINARY Heaps. The running time should be O(ElogV)

Your program should read data from file (see samples below) and output a single number = sum of lengths of the shortest paths from node 0 to each node. INPUT FORMAT: The first line of each file below contains the number of vertices and the number of edges in the graph (in the format "n=XXXX m=XXXXX"). The rest of the file is organized as follows: each vertex i appears on a line by itself, followed by a line for each neighbor j>i of i (containing j and the length of edge (i,j)). Each list of neighbors is ended by an empty line. Vertices i which do not have neighbors with an index greater than i are not represented. NOTE: Vertices are indexed from 0 to n-1. NOTE: each edge is mentioned only once with its smaller number endpoint SAMPLE INPUT: 1. first input 2. second input the length of the shortest path tree should be 10721073 and 625349 respectively. Program should give output in 3-10 seconds for the first input and less than 1 second for the second.

Given outputs are 100% correct. If you happen to get different ones, it means that your program fails to CHECK for all possible cases. Note that it is harder to get the correct output for the "first_input" (bigger one). You have to think what could be the reason, and how to overcome it.