Dijkstra algoritmh implemenation for academic purposes

The main objective of this project is to refactor existing java source files that utilize the Dijkstra [login to view URL] implementation should utilize grid partitioning for the graph,edge reweighting(similar to A star) ,priority queue implementation,Fibonacci heap implementation and a custom methodology on grid partitioning most probably with a clustering algorithm ie k-means. Also a unit testing method should be implemented. This project is for academic [login to view URL] details should be provided through pm.