iproute alternatives and similar packages

Based on the "Algorithms" category.
Alternatively, view iproute alternatives based on common mentions on social networks and blogs.

build

9.5 0.0 iproute VS build

Build Systems à la Carte
arithmoi

9.5 0.0 iproute VS arithmoi

Number theory: primes, arithmetic functions, modular computations, special sequences

Static code analysis for 29 languages.

Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.

Promo www.sonarqube.org

toysolver

9.3 0.0 iproute VS toysolver

My sandbox for experimenting with solver algorithms.
ersatz

8.9 0.0 iproute VS ersatz

A monad for interfacing with external SAT solvers
aeson-diff

8.5 0.0 iproute VS aeson-diff

Generate and apply diffs between JSON documents.
graphs

8.3 0.0 iproute VS graphs

a monadic graph library
funsat

8.2 0.0 iproute VS funsat

An efficient, embeddable DPLL SAT solver in Haskell
primes

8.2 0.0 iproute VS primes

Prime Numbers for Haskell
HMM

7.9 0.0 iproute VS HMM

hidden markov models in haskell
union-find

7.9 0.0 iproute VS union-find

Efficient union and equivalence testing of sets.
presburger

7.8 0.0 iproute VS presburger

Decision procedures for Presburger arithmetic in Haskell
imj-animation

7.8 2.5 iproute VS imj-animation

Monorepo for a multi-player game engine, and game examples
text-metrics

7.6 0.0 iproute VS text-metrics

Calculate various string metrics efficiently in Haskell
search-algorithms

7.5 0.0 iproute VS search-algorithms

Haskell library containing common graph search algorithms
lca

7.4 0.0 iproute VS lca

Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing
ADPfusion

7.3 0.0 iproute VS ADPfusion

Efficient, high-level dynamic programming
Adaptive

6.9 0.0 iproute VS Adaptive

Library for incremental computing.
dtw

6.6 0.0 iproute VS dtw

Implementation of Dynamic Time Warping in Haskell
edit-distance

6.5 0.0 iproute VS edit-distance

Edit distance library for Haskell
qchas

6.3 0.0 iproute VS qchas

A library for implementing Quantum Algorithms
treeviz

6.3 0.0 iproute VS treeviz

Haskell library for visualizing algorithmic decomposition of computations.
incremental-sat-solver

6.2 0.0 iproute VS incremental-sat-solver

Simple, Incremental SAT Solving as a Haskell Library
ListTree

6.2 0.0 iproute VS ListTree

A List monad transformer and related tools
integer-logarithms

6.0 0.0 iproute VS integer-logarithms

Integer logarithms, originally split from arithmoi package
binary-search

5.8 0.0 iproute VS binary-search

Binary and exponential searches
cmaes

5.4 0.0 L1 iproute VS cmaes

CMA-ES wrapper in Haskell
twentyseven

5.4 0.0 iproute VS twentyseven

Rubik's cube solver in Haskell
sgd

5.3 0.0 iproute VS sgd

Stochastic gradient descent Haskell library
GraphSCC

5.2 0.0 iproute VS GraphSCC

Tarjan's algorithm for computing strongly connected components
nonlinear-optimization-ad

4.8 0.0 iproute VS nonlinear-optimization-ad

Wrapper of nonlinear-optimization package for using with ad and backprop packages
DP

4.8 0.0 iproute VS DP

Holder for a bunch of semirings used in ChartParsing
TrieMap

4.6 0.0 iproute VS TrieMap

Generalized tries for Haskell
edit-distance-vector

4.4 0.0 iproute VS edit-distance-vector

Calculate edit scripts and distances between Vectors.
KMP

4.4 0.0 iproute VS KMP

Knuth–Morris–Pratt string searching algorithm
infinite-search

4.4 0.0 iproute VS infinite-search

An implementation of Martin Escardo's exhaustively searchable sets in Haskell.
union-find-array

4.4 0.0 iproute VS union-find-array

ST based union find data structure
primal

4.1 0.0 iproute VS primal

Primitive World of Haskell
graph-generators

4.1 0.0 iproute VS graph-generators

A Haskell library for creating random Data.Graph instances using several pop
adp-multi

4.1 0.0 iproute VS adp-multi

Prototype of ADP for MCFL (multiple context-free languages)
jps

3.9 0.0 iproute VS jps

:point_right: jump point search for Haskell
primesieve

3.9 1.1 iproute VS primesieve

A collection of packages related to math, algorithms and science, in Haskell.
pathfinding

3.7 0.0 iproute VS pathfinding

Haskell pathfinding library
spacefill

3.7 0.0 iproute VS spacefill

Space-filling curves
pell

3.4 0.0 iproute VS pell

Haskell Package to solve the Generalized Pell Equation
epanet-haskell

3.1 0.0 L2 iproute VS epanet-haskell

Call the EPANET toolkit via Haskell's Foreign Function Interface
MIP

3.0 0.0 iproute VS MIP

Libraries for reading/writing MIP problem files, invoking external MIP solvers, etc. in Haskell
edit-distance-linear

3.0 0.0 iproute VS edit-distance-linear

Levenshtein edit distance in linear memory (also turns out to be faster than C++)
fibonacci

2.8 0.0 iproute VS fibonacci

Fast computation of Fibonacci numbers in Haskell
stable-marriage

2.8 0.0 iproute VS stable-marriage

library around stable marriage algorithms
primes-type

2.8 0.0 iproute VS primes-type

Type-safe prime numbers.

* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.

Do you think we are missing an alternative of iproute or a related project?

Add another 'Algorithms' Package

Popular Comparisons

README

Haskell library for IP addresses and IP routing table.

This library can handle both IPv4 and IPv6 addresses.

The IP routing table is a finite map (or an associative array) based on the longest match.

The algorithm of the IP routing table is described in "Radish -- A Simple Routing Table Structure for CIDR" and its PDF is found on the following page:

http://www.mew.org/~kazu/proj/iproute/en/

iproute

IP Routing Table in Haskell

iproute alternatives and similar packages

Popular Comparisons

README

Haskell library for IP addresses and IP routing table.