dijkstra’s shortest path algorithm in java

 I have to make an application using java programming. i have done most  of the part i just have to complete PriorityQueue.java and  DijkstraSearch.java file from the attached files to run the app

Your code should NOT be shared with anyone.

Your app shoulduse ‘trubgp’ library,

read a graph file when the ‘Read’ button is clicked,

when the ‘Search’ button is clicked,read two vertices,

search a shortest path from the first (start) vertex to the second (end) vertex,

display all the vertices that are visited,

display the found shortest path from the start vertex to the end vertex

Note: You should use the trubgp board when you display anything.