Helper class for keeping track of a node partitioning based on IntHashSets.

Helper class for keeping track of a node partitioning projections based on IntHashSe...

Lightweight entry object for ordering nodes in a queue/deque based on weight.

EdmondsKarp implementation of the maxflow algorithm using a deque. Finds the maximum...

Abstract MaxFlowMinCut implementation.

Factory for Fast Isochrone Preparation This code is based on that from GraphHopper G...

Parameters for fast isochrone algorithm preprocessing and query processing. Some def...

Data element for partitioning.

Recursive implementation of InertialFlow algorithm for partitioning a graph.

Based on https://stackoverflow.com/questions/ 4958330/java-executorservice-awaittermi...

Temporary preprocessing time storage for max flow min cut data.

Creates the data necessary for running a max flow min cut algorithm.

Prepares the partition of the graph.

Helper class for sorting.