kit-algo / flow-cutterLinks
Experimental FlowCutter Code
☆13Updated 6 years ago
Alternatives and similar repositories for flow-cutter
Users that are interested in flow-cutter are comparing it to the libraries listed below
Sorting:
- Vienna Graph Clustering☆17Updated last month
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Updated 5 years ago
- This repository contains C++ source code used in several publications in the area of route planning.☆39Updated 4 years ago
- C++ implementation and evaluation for the InertialFlowCutter algorithm to compute Customizable Contraction Hierarchy orders.☆15Updated 2 years ago
- KaTCH -- Karlsruhe Time-Dependent Contraction Hierarchies☆79Updated 4 years ago
- Simple non-academic performance comparison of available open source implementations of R-tree spatial index using linear, quadratic and R…☆49Updated 6 years ago
- Templated Portable I/O Environment☆114Updated 7 months ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆137Updated 2 years ago
- C++ STL-like Fibonacci heap and queue for fast priority queues with mutable keys.☆68Updated 3 years ago
- RoutingKit is a C++ library that provides advanced route planning functionality.☆406Updated last year
- A well-documented C++ implementation of the cover tree datastructure for quick k-nearest-neighbor search. Allows single-point insertion a…☆62Updated 7 years ago
- A C++ RangeTree implementation.☆43Updated 5 years ago
- Fast maximum-minimum filters implemented in C++☆47Updated 2 years ago
- ☆17Updated 9 months ago
- C++ Implementation of Customizable Route Planning (CRP) by Delling et al.☆121Updated 9 years ago
- Boost.org graph module☆368Updated last week
- Library for performing spectral clustering in C++☆80Updated 2 years ago
- Fast, vectorized C++ implementation of K-Means using the Eigen matrix template library. Includes Matlab and Python interfaces.☆58Updated 8 years ago
- A Graph Coloring Algorithm Package☆64Updated last year
- Optizelle [op-tuh-zel] is an open source software library designed to solve general purpose nonlinear optimization problems.☆67Updated 5 years ago
- An implementation of the k-shorest-paths algorithm in Cpp☆76Updated 6 months ago
- Sequential object-oriented simPlex☆72Updated last week
- C++ library for numerical arrays and tensor objects and operations with them, designed to allow Matlab-style programming.☆52Updated 2 years ago
- N-dimensional RTree implementation in C++☆428Updated 9 months ago
- Automatic Differentiation C++ Library☆58Updated 5 years ago
- Yet Another SDP Solver☆10Updated 10 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- Unofficial unmaintained clone of LEMON Graph Library☆49Updated 6 years ago
- Naive Hilbert R-Tree implementation☆31Updated 10 years ago
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Updated last year