Implement Dijkstra's algorithm using a priority queue and adjacency list in java. Implement a counter within the code to run the efficiency of the priority queue and the adjacency list. Also, implement file reader that will allow for test case files containing the vertex, weight, and connecting vertex to be uploaded and used to run against the code.