Open Source Algorithms - Page 60

Algorithms and data structures implemented in JavaScript with explanations and links to further readings

Collection of essential computer science data structures in Javascript. Plus some additional nifty datastructures coming in upcoming versions. Contains basic data structures - Node - BinaryNode - TernaryNode - Stack - Queue - Dequeue

A simple java library for text and object oriented code. Among the different available packages, there are for text analysis (levenshtein and ngram fingerprinting), a grammar framework, simple object persistence (very light and dependence free), ...

This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.

Java library for operations with Iterables and other data structures in functional way.

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/

jpaul is a Java implementation of several algorithms widely used in program analysis. It emphasizes flexibility and ease-of-use and is independent of any specific compiler infrastructure project. BSD Licence.

jr239co620

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

jsprit is a java based, open-source toolkit for solving rich Traveling Salesman Problems(TSP) and Vehicle Routing Problems(VRP). It is lightweight, flexible and easy-to-use, and based on a single all-purpose meta-heuristic. Setting up the problem, defining additional constraints, modifying the algorithms and visualizing the discovered solutions is as easy and handy as reading classical VRP instances to benchmark your algorithm. It is fit for change and extension due to its modular design and a comprehensive set of unit and integration tests. Possibility to define additional stateless and stateful constraints/conditions to account for the richness of your problem. GraphHopper invests in an active open source community. Our flagships are the GraphHopper routing engine and jsprit, the toolkit for solving rich vehicle routing problems. We promote a fair & diverse mindset.

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

Class : KConvert for convert character sets between ascii code and unicode.

Application to test a GA solution for the Knapsack problem, it will compare Genetic Algorithm solution of the Knapsack problem to greedy algorithm.

This project has be renamed to jnum and moved under the crush-software project. No further SVN commits here...

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.

ktsolver - Knight's Tour problem solver. Finds quickly a lot of solutions of the Knight's Tours problem.

Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.

The name leet stands for "Linux exquisite encryption tool", it will be a software application for on-the-fly encryption, similar in its functionality to TrueCrypt. The goal of leet however is to be simpler and as user friendly as possible, making encryption and securing of information accessible to anybody, even those who don't necessarily have any prior knowledge of data securing, algorithms and encryption. However it's not targeted at this group of users only, part of the ambition of this project is to reach companies, institutions, governments (etc...) as well.

libBAD is a basic collections of algorithms and data structures.

A simple library to generate pseudo unique long (int64) identifiers. Collisions are expected, they are usually under 0.20%.

libObfuscate 2.00 ISO C / open-source / system independent * Modern 256bit cryptography: AES, Anubis, Camellia, Cast-256, Clefia, FROG, Hierocrypt3, Idea-NXT, MARS, RC6, Safer+, SC2000, Serpent, Speed, Twofish, Unicorn-A, Wrapper * CSPRNG (based on AES) * Modern 512bit hashing: Grostl, Keccak, SHA2, Skein, Wrapper * Scrambling * Multi-layered obfuscation

libPPP is an advanced image compression library. Depending on the content of the image, it uses either PGF (Progressive Graphics File) or PNG (Portable Network Graphics) to compress the image.

This is a repartition generator for a bunch of repartitions. It is done in C++ (MFC) and you interface with it with a string.

A Library to calculate smooth lines in 2D and 3D. Given some polyline, a finer segmented polyline is generated. The smoothed line may hit the original points or its length may be equal to the original length. Linear equations solvers are also provided.

TiGems is a Graphical Engineering Modeling System owned by Tsinghua University. A part of the libraries used in TiGems is now open-sourced. These libraries are hosted in SourceForge now.