Pinned Repositories
graph-distance-matrix
Distance matrix calculation in Weighted-Graph datastructure. Calculate a matrix with 10K start vertex * 10K end vertex in 1 second, even in 100ms.
InfoQInterview
jpaQuery
jVisualVM
monkey
lossless compression algorithm for floating-point， with better compression ratio than Gorilla
shortest
Java base implement of short-path algorithms: Contraction hierarchies, Transit node routing, Hierarchical Hub Labeling.
YouBenshan's Repositories
YouBenshan/jVisualVM
YouBenshan/monkey
lossless compression algorithm for floating-point， with better compression ratio than Gorilla
YouBenshan/graph-distance-matrix
Distance matrix calculation in Weighted-Graph datastructure. Calculate a matrix with 10K start vertex * 10K end vertex in 1 second, even in 100ms.
YouBenshan/InfoQInterview
YouBenshan/jpaQuery
YouBenshan/shortest
Java base implement of short-path algorithms: Contraction hierarchies, Transit node routing, Hierarchical Hub Labeling.