Open Source Windows Algorithms - Page 46

glint is a tool facilitating you in development of state-oriented control entities which supposed to be used in very broad areas of programming (e.g. state-oriented network protocols). glint saves you from pondering how your finite state machine should be organized, how many states it should have and what they should mean. You just tell glint how you would like your control entity to operate and glint returns to you the synthesised magic black box which implements the desired logic. Also glint can tell you in regexp style which event sequences your FSM can handle and which are forbidden for it.

go-algorithms is an open-source educational repository that provides implementations of common algorithms and data structures written in the Go programming language. The project is designed primarily as a learning resource to help developers understand how fundamental computer science concepts can be implemented idiomatically in Go. It includes a wide range of classic sorting, searching, and numerical algorithms alongside basic collection structures such as stacks, queues, linked lists, and binary trees. The repository is organized into clear directories by topic, making it easy for learners to explore specific categories of algorithms. Because the code focuses on clarity over heavy abstraction, it is especially useful for students and developers studying algorithmic fundamentals. Overall, go-algorithms serves as a practical reference and study companion for Go programmers building a strong foundation in data structures and algorithm design.

An extremely memory-efficient hash_map implementation. 2 bits/entry overhead! The SparseHash library contains several hash-map implementations, including implementations that optimize for space or speed.

Porting of the core simulation portions of smoldyn to the GPU, using CUDA

Interface to deal with graphs ( Adjacency list representation ) written in C... Only basic operations available now, soon to be more =) Small project to college, not much implemented yet...

GraphSmart is a collection of graph data structures and algorithms utilizing generics and the Microsoft .NET 2.0 Framework. Included items are commonly used in software engineering but not included in the .NET 2.0 Framework class library.

The gruft library is a fast implementation of several cryptographic functions in JavaScript: MD5, SHA-1, SHA-256, Tiger/192, AES-Rijndael.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

** MOVED: to github.com/gundermanc/gundercrypt A CLI text ciphering program and library written in java that makes use of pseudo random numbers and a password (provided by the user) to generate encrypted text by selectively shifting each subsequent letter by a pseudo-random index, encoding it as a letter stored in a hidden position within the String, and then re shifting the encrypted String again by numeric values deduced from a password to provide a dual layer of security. Easily can be imported into any java project or run via shell commands.

It is useful to understand how hamming coding running is in network layer on TCP/IP protocol [TÜRKÇE] OSI ve TCP/IP de ağ katmanında kullanılan hamming kodlamasının nasıl işlediğini gösteren eğitim amaçlı bir uygulamadır.

C++ implementation of Hash Array Mapped Trie (HAMT). Class design follows STL principles and aims to meet the requirements and to provide the guarantees of std::hash_map.

Headrand is a static library wrote in c that contains functions to simulate complex systems or make statistical analysis with a new approach called "random function computing"

PermutationCounter (VB.NET with ActiveX) - Lists all permutations of a list of given numbers.

There you will find my works of different sets of asm libs like "Still Mpeg Assembly Decompressor" , "LZW16 compressor & decompressor for lzw16 & gif" , "Lzss de/compressor similiar to aplib,upx etc but faster&better de/compression" , "Jpeg decode lib" ,

iGesture is a Java-based gesture recognition framework providing access to multiple gesture recognition algorithms and different input devices. The iGesture Workbench supports the definition and evaluation of customised gesture sets and algorithms.

iMet-Q (intelligent Metabolomic Quantitation) is an automated tool with friendly user interfaces for quantifying metabolites in full-scan liquid chromatography-mass spectrometry (LC-MS) data. It has a complete quantitation procedure for noise removal, peak detection and peak alignment. In addition to accurate quantitation, iMet-Q provides the charge states and isotope ratios of detected compounds. It accepts input data in netCDF, mzXML, and mzML format and exports quantitation results in csv and txt format. The software source code is freely available under the license of GPL2.

iVSwap is a simple function which can be used as a library and swaps values between two variables in a mathematical way using a classic Boolean algebra law without the need of a buffer! The advantages of this technique is speed and portability.

A simple image utility in C++. Although the boost::gil library is a great one, I can not understand the complex c++ template syntax in it. So i write a simple one( also limited functional )

Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas.

IntZip is a lossless compression algorithm for strictly increasing lists of unsigned integers. Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list, such as coherent intervals and repeated distances. Therefore, the quality of compression depends on diversity rather than size. In most cases, IntZip is able to achieve much better compression results than general compression algorithms on such data sets.

Algorithm Visualizer for IPython/Jupyter Notebook. If you use the display(TracerObject) code from where you want to see, you can use it without any special modification.

An information extraction library implementing modern algorithms for the extraction of named entities from text.

ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl.

jChecs is an open source Java chess program, designed to introduce the basics of computer chess programming concepts.

Simple genetic programming framework. Features a robust set of interfaces and standard implementations for rapid development and ease of experimentation.