Select a tag to browse associated projects and drill deeper into the tag cloud.
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 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_
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 ﬁle 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]
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]
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 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]
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.
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 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]
Copyright © 2013 Black Duck Software, Inc. and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a Creative Commons Attribution 3.0 Unported License . Ohloh ® and the Ohloh logo are trademarks of Black Duck Software, Inc. in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.