Java base implement of short-path algorithms: Contraction hierarchies, Transit node routing, Hierarchical Hub Labeling.
Some code is inspired by jGrapht and improved for better performance using fastutil and multi-thread.
Data used in Test class (offline/src/test/java/you/bs/shortest/offline/GrTest.java) is from Dimacs 9 Challenge.