Search Results for "algorithm"
Sort By:
Showing 134 open source projects for "algorithm"
View related business solutions-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
1
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. -
2
X's Recommendation Algorithm
Source code for the X Recommendation Algorithm
The Algorithm is Twitter’s open source release of the core ranking system that powers the platform’s home timeline. It provides transparency into how tweets are selected, prioritized, and surfaced to users, reflecting Twitter’s move toward openness in recommendation algorithms. The repository contains the recommendation pipeline, which incorporates signals such as engagement, relevance, and content features, and demonstrates how they combine to form ranked outputs. -
3
AlgoSim
AlgoSim : création, analyse et exécution des algorithmes
AlgoSim un Logiciel de création, analyse, simulation et exécution des algorithmes. Il ne nécessite aucun apprentissage de langage de programmation. Ce logiciel n'utilise pas un éditeur de texte comme les logiciels classiques de programmation. Ce logiciel peut être utilisé par des débutants pour apprendre la programmation et exercer leurs connaissances. Il peut être utilisé par des professionnel pour tester leurs algorithmes, les vérifier et générer des programme présentables (pseudo-code ou... -
4
google-java-format
Reformats Java source code to comply with Google Java Style
...The formatter can act on whole files, on limited lines, on specific offsets, passing through to standard-out (default) or altered in-place. There is no configurability as to the formatter's algorithm for formatting. This is a deliberate design decision to unify our code formatting on a single format. The formatter can be used in software that generates java to output more legible java code. Just include the library in your maven/gradle/etc. configuration. A google-java-format IntelliJ plugin is available from the plugin repository. ... -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
SOFAJRaft
A production-grade java implementation of RAFT consensus algorithm
SOFAJRaft is a production-level, high-performance Java implementation based on the RAFT consistency algorithm that supports MULTI-RAFT-GROUP for high-load, low-latency scenarios. With SOFAJRaft you can focus on your business area. SOFAJRaft handles all RAFT-related technical challenges. SOFAJRaft is very user-friendly, which provides several examples, making it easy to understand and use. -
6
Random Cut Forest by AWS
An implementation of the Random Cut Forest data structure
This repository contains implementations of the Random Cut Forest (RCF) probabilistic data structure. RCFs were originally developed at Amazon to use in a nonparametric anomaly detection algorithm for streaming data. Later new algorithms based on RCFs were developed for density estimation, imputation, and forecasting. The different directories correspond to equivalent implementations in different languages, and bindings to to those base implementations, using language-specific features for greater flexibility of use. -
7
International Components for Unicode
The home of the ICU project source code
...ICU's conversion tables are based on charset data collected by IBM over the course of many decades and is the most complete available anywhere. Compare strings according to the conventions and standards of a particular language, region or country. ICU's collation is based on the Unicode Collation Algorithm plus locale-specific comparison rules from the Common Locale Data Repository, a comprehensive source for this type of data. -
8
Bifurcum
Software to run through a directional graph.
This software runs through a directional graph and writes the paths it found as test specifications. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This application sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. Technically it is a front end for the library Bifurcumlib. -
9
PWSLIB3
Password Safe encrypted databases, Java library
Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
hello-algorithm
Algorithm training for Xiaobai
hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. -
11
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. Usage from command line is also possible but with reduced flexibility (cf. ... -
12
JQuickBase
elementary database files for Java, B+ tree index files, ISAM
...Includes scalable database files w/ space recovery and variable record length, scalable B+Tree index files. Supports file backup and restore. Two package types: one with and one without strong file encryption using Twofish algorithm and state-of-the-art encryption technology. -
13
TengineKit
TengineKit - Free, Fast, Easy, Real-Time Face Detection
Free, Fast, Easy, Real-Time Face Detection & Face Landmarks & Face Attributes & Hand Detection & Hand Landmarks & Body Detection & Body Landmarks & Iris Landmarks & Yolov5 SDK On Mobile. TengineKit is an easy-to-integrate AI algorithm SDK. At present, it can run on various mobile phones at very low latency. We will continue to update this project for better results and better performance! -
14
BifurcumLib
A library for running through a directional graph.
This is the library for the project Bifurcum. It does all the work. It has a simple algorithm (Deep First Search with modifications) and allows sorting children before traversing. This library sums up the authors 4-years experience when programming a commercial tool for graph traversing (which used a much more advanced algorithm) and coaching its users. -
15
java-string-similarity
Implementation of various string similarity and distance algorithms
...This was published by Masek in 1980 ("A Faster Algorithm Computing String Edit Distances"). -
16
jsprit
Open source toolkit for solving rich vehicle routing problems
...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. ... -
17
AhoCorasickDoubleArrayTrie
An extremely fast implementation of Aho Corasick algorithm
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. -
18
AES Everywhere
Cross Language AES 256 Encryption Library
AES Everywhere is Cross Language Encryption Library that provides the ability to encrypt and decrypt data using a single algorithm in different programming languages and on different platforms. This is an implementation of the AES algorithm, specifically CBC mode, with 256-bit key length and PKCS7 padding. It implements OpenSSL-compatible cryptography with randomly generated salt. -
19
Javaluator
A java infix evaluator based on "Shunting Yard" algorithm.
Evaluate an arithmetic expression is as simple as: Double result = new DoubleEvaluator().evaluate("(e^3-1)*sin(pi/4)*ln(pi^2)"). But Javaluator provides you with much more ... Key features: - Functions support, including variable argument count. - Constants support: e, pi, etc ... - Variables support: Example sin(x) for x = pi/4. - Highly configurable: Reduce the built-in operator or function sets, define your own brackets. - Extensible: Define your own grammar, or extends the... -
20
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
...It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer -
21
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. ...
-
22
PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.
-
23
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. You may download code: git clone git://git.code.sf.net/p/pointsymmetryclustering/code pointsymmetryclustering-code 2. Build: mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true 3. ... -
24
Latin Square Toolbox
Generates Latin squares and counts their transversals
The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options. This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools: 0. Latin Square Generator (LSG) 1. Latin Square Transversal Counter (LSTC) 2. Latin Square Property Checker (LSPC) -
25
Format-Preserving Encryption
Format-Preserving Encryption Library for Java
...The FF1 and FF3 methods for format-preserving encryption are implementations of NIST Special Publication 800-38G, Recommendation for Block Cipher Modes of Operation: Methods for Format-Preserving Encryption. The FFX algorithm and A2 and A10 parameter sets are implementations of "The FFX Mode of Operation for Format-Preserving Encryption," by Mihir Bellare, Phillip Rogaway, and Terence Spies. For more information see the README.txt and package-info.java files in the source.
