We are pleased to announce the release of a collection of algorithms in Java for finding k earliest arrival time journeys in public transit networks.
We are pleased to announce the release (version v2.0) of a collection of algorithms in C++ for computing the hyperbolicity of graphs. It includes algorithms enabling to compute the hyperbolicity of graphs with unprecedented size (up to a million nodes).
We are pleased to announce the release (version v1.0) of a collection of algorithms in C++ for solving the k shortest simple paths problem in weighted directed graphs.
We are pleased to announce the release of an implementation in C++ of HLCSA and HLRaptor which are variants of Connection Scan Algorithm (CSA) and RAPTOR supporting unrestricted walking through the use of a hub labeling of the footpath graph.
