Projects

Math.NET Numerics

A mathematical open source library written in C#/.Net, aiming to provide a self contained clean framework for symbolic algebraic and numerical / scientific computations.

pyrcc

pyrcc is a collection of tools written in python programming language to facilitate the computational treatment of a combinatorial protein structure description termed _Residue Cluster Class System_

gteditor

The purpose of the graph editor is to make it fast and easy to draw graphs, perform some simple operations on graphs and export graphs to useful file formats etc. The graph editor can also be used to study the structure of graphs by moving it’s parts around in an intuitive way. The program is ... [More] developed in the programming language Java and thereby platform independent. The program uses a lot of open source software libraries. In particular it uses the JGraph which is a software library for graph manipulation. Installation Contribute Contact [Less]

hungarianassignment

From Wikipedia: "The Hungarian algorithm is a combinatorial optimization algorithm which solves assignment problems in polynomial time (O(n3)). The first version, known as the Hungarian method, was invented and published by Harold Kuhn in 1955. This was revised by James Munkres in 1957, and has ... [More] been known since as the Hungarian algorithm, the Munkres assignment algorithm, or the Kuhn-Munkres algorithm." This implementation uses C++ and the STL Vector class to build the assignment matrix and perform the operations of the algorithm to find an optimal solution to an assignment problem. Disclaimer: There are some structural elements of this program which are not generally lauded in standard programming practice. In any case where you see a portion of code and think "Wow, this guy doesn't know what he's doing!", there is certainly a very good reason why I did what I did. Usually these are to improve the runtime of the algorithm by a small constant coefficient. These never change the actual Big-O runtime of the program but these small improvements certainly add up when doing as many operations as may be necessary. [Less]

linear-ecc

This is a code repository for the GAP package GUAVA, and the on-going port from GAP to Python/SAGE. To browse the code which has been ported so far, go to the SAGE code browser and click on coding.

qombinatorics

qombinatorics aims to be a complete resource for combinatorics calulations. Combinatorics, in mathematic, is the study of the many possible way to arrange a given set of objects. (http://en.wikipedia.org/wiki/Combinatorics) Many probability calculation are possible through the knowledge of this ... [More] branch of mathematics and can be easily applied to a great number of common situation, e.g. card games. [Less]

claybusbeiy

Greetings! Clay Busbeiy is the algorithm platform that addresses the needs of automation/robotics creation. This platform is based on the OpenTheorem™ format, and is configured as cellular combinatoric output.

Wordlist

A Ruby library for generating and working with word-lists. Wordlist allows one to efficiently generate unique word-lists from arbitrary text or other sources, such as website content. Wordlist can also quickly enumerate through words within an existing word-list, applying multiple mutation rules to each word in the list.

stixar-graphlib

stixar-graphlib is a library of efficient graph algorithms featuring at its base an advanced graph attributes systems, efficient adjacency list based graph implementations, simple interfaces for arbitrary graph implementations and a (growing) collection of well-implemented fundamental graph ... [More] algorithms. In addition, stixar-graphlib provides library implementations of basic efficient algorithms such as linked lists (with an interface for list cells), union-find, and a variety of priority queues. [Less]