Search Results for "edmonds-karp algorithm implementation in python"

vtrunkd - network link bonding and multichannel VPN. Vtrunkd is a Linux VPN daemon used to combine several connection paths into one aggregated channel. Features latency, reordering and jitter management, behaviour analysis optimizations for encapsulated protocols, bufferbloat control, packet redundancy, and multiple cpu cores utilization. Up to 30 heterogenous links bonding supported. Used for live streaming, LTE/3G/Wi-Fi link bonding. 32/64-bit, x86, MIPS and ARM supported. Supports python...

Gumbo is an implementation of the HTML5 parsing algorithm implemented as a pure C99 library with no outside dependencies. It's designed to serve as a building block for other tools and libraries such as linters, validators, templating languages, and refactoring and analysis tools. Gumbo gains some of this by virtue of being written in C, but it is not an important consideration for the intended use-case, and was not a major design factor.

This music player is supposed to be simple and all centered around an infinite intelligent queue (some other players call this PartyShuffle or DJ mode). You can manually add songs to it - but if you don't or the queue gets too short, it will automatically intelligently fill it with further songs. The intelligent queue decision currently is based on: * song ratings * context-based choices, e.g. related songs more likely Other features of this player: * open source, simplified BSD...

This is a fast C implementation of Arturo Camacho's SWIPE' pitch extraction algorithm. See the project homepage for more about the advantages of the SWIPE' algorithm. swipe-1.0.tar.gz contains the current source, which should compile quite neatly.

FriBidi Python bindings: FriBiDi is a BiDi algorithm implementation for Hebrew and/or Arabic languages. This package include python module for the FriBidi C library.

Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.

A Python and ANSI C implementation of the Edelsbrunner hyperplane arrangement algorithm described in his book Algorithms in Combinatorial Geometry, supporting arbitrary dimensions, exact rational arithmetic using gmp, and using David Avis lrs solver.

Definition and implementation(s) of a 'numerically aware' string compare algorithm: 'A1' < 'A2' < 'A3' < 'A10' < 'A11' < 'B1'.

...Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.