Open Source Algorithms

The Adobe Source Libraries (ASL) are a collection of C++ libraries building foundation technology to allow the construction of commercial applications by assembling generic algorithms through declarative descriptions.

YABI93 is an Interpreter for the esoteric programming language Befunge, version "Befunge93". It is written in Java 1.5 and uses Swing for its graphical interface. YABI supports a multilanguage GUI.

GFP use Genetic Programming and LISP-like language for growing program.

Use, study and develop advanced digital halftoning algorithms with Halftone Laboratory, a GIMP plug-in backed by a highly modular and extensible library. It uses .NET/Mono and GIMP#.

oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation; particularly (but certainly not exclusively) suitable for the financial domain.

Solution for UVa Online Judge's problem number 895 - Word Problem. This is the solution I uploaded, and it was accepted as valid.

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

Simple and Fast Exception Handling for C.

Ertha is an open source GIS whose main focus is to guarantee easy extensibility and straightforward integration of custom modules. It provides basic geographic rendering and topologic analysis and exposes the main data structures loaded from shapefiles.

http://www.filehelpers.net The FileHelpers are an easy to use .NET library written in C#. Is designed to read/write data from flat files with fixed length or delimited records (CSV). Also has support to import/export data from different data storages (Excel, Access, SqlServer) Code on GitHub: https://github.com/MarcosMeli/FileHelpers

This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs.

!!! The project has been renamed to "libanculus-sharp" and has been moved to googlecode : http://code.google.com/p/libanculus-sharp/ !!! LibCommon is a reusable library written in C#. It runs on Mono 1.2 or higher and .NET 2.0 or higher. It provides an

This project has moved and is not any longer developed. Please see http://sibirjak.com/blog/index.php/lite-collections/ for more details.

PHASH is a self-contained, dependency-free, post-quantum XOF hashing algorithm implemented in modern C++20. This release delivers the first fully stable production implementation of the PetoronHash-System — a 1600-bit sponge-based hash function with domain separation, extendable output, and deterministic behavior. Key Features No external dependencies — pure C++20 implementation. Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). Post-quantum oriented design — ARX-based sponge resistant to Grover-type attacks. Context and salt separation — unique hashing domains for each use-case. Optimized performance — ~120–130 MB/s Comprehensive verification — verify_all.sh performs KAT tests, determinism checks, and performance validation. Verification Script: chmod +x verify_all.sh ./verify_all.sh https://github.com/01alekseev/PetoronHash-System Ivan Alekseev | petoron.org

PetoronHash2 (PH2) is a standalone ARX-based sponge construction that combines: A 4096-bit internal permutation core A sponge/duplex architecture with explicit capacity separation An extendable-output function (XOF) Memory-hard (HARD) and burn (BURN) modes A structured tagged absorb scheme A parameterized architecture suitable for hashing, KDF, and stress-oriented derivation PH2 is designed as a wide-state cryptographic primitive with explicit domain separation and configurable output length. https://github.com/01alekseev/PetoronHash2 Petoron | Ivan Alekseev | MIT license

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

VRMosaic for Lazarus a sliding cells puzzle game written using Free Pascal for Lazarus [*] now include auto mosaic resolver (Aug 2023) !! includes Lazarus sources & build project another fine SunStorm release Vincent Radio {Adrix.NT} adrixnt@hotmail.it

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.

To work on a dhcpd.conf that everyone can use for multiple different dhcp servers on one system and for different reasons.

The judyhash project provides C++ STL-style maps and sets based on unique algorithms and having unique characteristics.

A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.

TAROT is a easy-to-use framework for Monte Carlo simulations in python. Calculations between different kinds of randomly distributed numbers are made as easy as basic arithmetics. Tarot provides an interactive graphical interface for interpretation.