Open Source Algorithms - Page 55

A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com). Given a log-file, this tool will replay a T4C game you've played before. It will have built-in functionnalities like : merging log files together, searching and cleaning

A collection of parallel image processing algorithms in pure Go. The aim of this project is simplicity in use and development over absolute high performance, but most algorithms are designed to be efficient and make use of parallelism when available. It uses packages from the standard library whenever possible to reduce dependency use and development abstractions. All operations return image types from the standard library. Package convolution provides the functionality to create and apply a kernel to an image. Package effect provides the functionality to manipulate images to achieve various looks. Package histogram provides basic histogram types and functions to analyze RGBA images. Package paint provides functions to edit a group of pixels on an image. Package parallel provides helper functions for the dispatching of parallel jobs.

In silico evolution of biochemical networks using a genetic algorithm combined with a rule-based biochemical network model.

Bitswarm is a computational-oriented project: it provides a library of n-dimensional bit-array manipulation primitives. Unix and win32 platforms are supported.

B-tree with a twist pointer set. The ordered set approaches the speed of the fastest unordered, hash table based sets, while using several times less memory.

brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).

BS is a data structures library. It features fixed data size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN).

bzip2 is a free and open-source file compression program that uses the Burrows–Wheeler algorithm. It only compresses single files and is not a file archiver. It is developed and maintained by Julian Seward. Seward made the first public release of bzip2, version 0.15, in July 1996. The compressor's stability and popularity grew over the next several years, and Seward released version 1.0 in late 2000. Official website: https://www.sourceware.org/bzip2/ Source: https://sourceware.org/pub/bzip2/?C=M;O=D

Expresses C program in graphical control flow chart in VCG GDL.

A light-weight Regular Expression (regex) C library, using double-recursion. (command prompt tester included)

Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications.

Written in C++ (using template). Calculator++ is a application/library for Window (POSIX). The core of code is adaptable for posix. This algorithm support: + built-in operator + built-in functions + run-time functions and variables definition + run-time units system, units with prefix + constants definition + Pretty mathematical expressions - Process ascii files (dev) - vector and matrix (dev) - graph 2D and 3D (dev) - vector graph (dev) - symbolic calculate (dev) - Animations (dev)

small library to ease the task of calling callback functions

callgraph is a project that provides an algorithm for an optimal vertex positioning of any connected graph in 3D, as well as the library and sample application for viewing graphs in 3D.

The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

Public description: The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

CDS (Concurrent Data Structures) is a C++ template library of lock-free and fine-grained lock-based algorithms. It contains a collection of concurrent data structures: queues, stacks, sets, maps, etc, and safe memory reclamation schema for concurrent containers - Hazard Pointer and user-space RCU. See doxygen doc http://libcds.sourceforge.net/doc/cds-api/index.html. The source code repo for libcds 2.x has been moved to https://github.com/khizmax/libcds

Common Lisp provides a SEARCH function to lookup given keys in a string, but its implementation can be subotimal: it can be beaten in some cases by even the simpliest brute-force algorithm. This project is aimed at implementing robust string matching algorithms for Common Lisp.

Backwards mappable double linked list for Common Lisp.

clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented. 1. Dynamic Array 2. Single Linked List 3. Heap 4. Map 4. Set.

CLOGS has moved to Github (https://github.com/bmerry/clogs)

An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.

A 2D rigid physics simulator and set of genetic algorithm tools. Evolve cute little walking creatures.

Programming Navigation is not just a website, but a complete ecology with the goal of "helping everyone discover high-quality programming resources and improve learning efficiency". It contains multiple sub-projects, and the technology stack includes React, Java SpringBoot, Tencent Cloud Development, etc., all of which are open source for everyone to learn, so that you can easily develop beautiful information navigation websites! Most of the programming navigation websites are in disrepair and have good navigation, but they are limited in search and classification, and they do not have functions such as self-recommendation and liking, so they are not sustainable.

Codefactor utilities: ReflectionThread, ObjectParser