RSS 9 projects tagged "Algorithm"

No download Website Updated 01 Nov 2009 Algorithm-Graphs-TransitiveClosure

Screenshot
Pop 28.28
Vit 40.44

Algorithm-Graphs-TransitiveClosure is a Perl module to calculate the transitive closure. This module is an implementation of the well known Floyd-Warshall algorithm.

No download No website Updated 26 Sep 2010 bin-packing

Screenshot
Pop 23.96
Vit 36.15

bin-packing is an implementation of the 1-dimensional bin packing algorithms in PHP: next fit, first fit, best fit, and worst fit.

No download Website Updated 01 Mar 2011 TommyDS

Screenshot
Pop 32.03
Vit 34.73

TommyDS is a C library of hashtables and tries designed for high performance. It's faster than other similar libraries like rbtree, khash, goodledensehash, uthash, judy, nedtrie, and others.

No download Website Updated 18 Nov 2012 DisPass

Screenshot
Pop 41.76
Vit 22.97

DisPass is a passphrase generator that generates unique passphrases formed from a master password and a label, helping you get rid of the bad habit of using a single password for multiple Web sites. It is a console application, but it also has a simple graphical interface.

No download Website Updated 15 Jul 2013 Satsuma

Screenshot
Pop 36.19
Vit 16.84

Satsuma is an easy-to-use and flexible graph library for .NET. It implements all the necessary graph structures and the fastest possible graph algorithms.

No download No website Updated 13 Aug 2013 squirrel-foundation

Screenshot
Pop 22.45
Vit 15.98

squirrel-foundation provides a lightweight, easy use, type safe, and highly extensible state machine implementation for Java.

Download Website Updated 20 Feb 2014 MOEA Framework

Screenshot
Pop 236.83
Vit 14.25

The MOEA Framework is a Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose optimization algorithms and metaheuristics. A number of algorithms are provided out-of-the-box, including NSGA-II, ε-MOEA, GDE3, and MOEA/D.

No download Website Updated 25 Feb 2013 Multi-Dimensional Data Structure

Screenshot
Pop 85.21
Vit 5.22

Multi-Dimensional Data Structure (mdds) is a C++ library that includes a collection of various data structures designed to efficiently store and query multi-dimensional data for various filtering criteria. Different structures are optimized for different query needs. The library is provided as a header only, meaning that programs do not need to link to any additional shared library in order to use these data structures. The data structures are all available as C++ templates.

No download Website Updated 11 Jan 2014 Global Paths Matching

Screenshot
Pop 38.42
Vit 1.00

Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.

Screenshot

Project Spotlight

grep

GNU grep, egrep and fgrep.

Screenshot

Project Spotlight

Packet Peeper

A network protocol analyzer for Mac OS X.