Search Results for "algorithms"
Sort By:
Showing 1673 open source projects for "algorithms"
View related business solutions-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
1
The Algorithms Python
All Algorithms implemented in Python
The Algorithms-Python project is a comprehensive collection of Python implementations for a wide range of algorithms and data structures. It serves primarily as an educational resource for learners and developers who want to understand how algorithms work under the hood. Each implementation is designed with clarity in mind, favoring readability and comprehension over performance optimization. -
2
C# Algorithms
Plug-and-play class-library project of standard data structures
Algorithms, a class library project which contains the Algorithms implementations. Data Structures, a class library project which contains the Data Structures implementations. Also, UnitTest, a unit-testing project for the Algorithms and Data Structures. -
3
Pythonic Data Structures and Algorithms
Minimal examples of data structures and algorithms in Python
The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. -
4
All RL Algorithms from Scratch
Implementation of all RL algorithms in a simpler way
All RL Algorithms from Scratch is an educational reinforcement learning repository built around readable Python and Jupyter Notebook implementations. Its goal is to help learners understand how major reinforcement learning algorithms work under the hood instead of hiding the logic behind large frameworks. The project includes notebooks for value-based methods, policy-gradient methods, actor-critic algorithms, model-based learning, multi-agent reinforcement learning, planning, and hierarchical approaches. ... -
Your monitoring isn't a stack. It's a pile. Fix that.Replace Datadog, New Relic, and Sentry without adding three more dashboards.
-
5
WindTerm
A professional cross-platform SSH/Sftp/Shell/Telnet/Serial terminal
...WindTerm is a partial open source project, and the source will be gradually opened. Open source code includes, but is not limited to, the classes that can be used independently, such as functional, algorithms, GUI widgets, etc., as well as functional libraries, such as networks, protocols, etc., as well as all types that require open source according to the license. SSH v2, Telnet, Raw TCP, Serial, Shell protocols were implemented. Supports SSH auto-execution when the session is authenticated. Integrated local file manager, supports the move to, copy to, copy from, remove, rename, make new file/directory and so on. ... -
6
CGAL
The Computational Geometry Algorithms Library
CGAL or the Computational Geometry Algorithms Library is a C++ library that gives you easy access to a myriad of efficient and reliable geometric algorithms. These algorithms are useful in a wide range of applications, including computer aided design, robotics, molecular biology, medical imaging, geographic information systems and more. CGAL features a great range of data structures and algorithms, including Voronoi diagrams, cell complexes and polyhedra, triangulations, arrangements of curves, surface and volume mesh generation, spatial searching, alpha shapes, geometry processing, and many more. ... -
7
Zstandard
Zstandard - Fast real-time compression algorithm
...Zstd can trade compression speed for stronger compression ratios. It is configurable by small increment. Decompression speed is preserved and remain roughly the same at all settings, a property shared by most LZ compression algorithms, such as zlib or lzma. -
8
PRML
PRML algorithms implemented in Python
...Many of these algorithms are paired with Jupyter notebooks that let users interact with the code, visualize results, and experiment with parameters in a way that deeply strengthens theoretical understanding. -
9
Machine Learning Octave
MatLab/Octave examples of popular machine learning algorithms
This repository contains MATLAB / Octave implementations of popular machine learning algorithms, along with explanatory code and mathematical derivations, intended as educational material rather than production code. Implementations of supervised learning algorithms (linear regression, logistic regression, neural nets). The author’s goal is to help users understand how each algorithm works “from scratch,” avoiding black-box library calls. -
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
10
Evolutionary.jl
Evolutionary & genetic algorithms for Julia
A Julia package for evolutionary & genetic algorithms. The package can be installed with the Julia package manager. -
11
PlatEMO
Evolutionary multi-objective optimization platform
...PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms published in top journals after 2010. Users can select various figures to be displayed, including the Pareto front of the result, the Pareto set of the result, the true Pareto front, and the evolutionary trajectories of any performance indicator values. PlatEMO provides a powerful and friendly GUI, where users can configure all the settings and perform experiments in parallel via the GUI without writing any code. -
12
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. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. ... -
13
SuiteSparse
The official SuiteSparse library: a suite of sparse matrix algorithms
The official SuiteSparse library: a suite of sparse matrix algorithms authored or co-authored by Tim Davis, Texas A&M University. -
14
Python Outlier Detection
A Python toolbox for scalable outlier detection
...PyOD contains multiple models that also exist in scikit-learn. It is possible to train and predict with a large number of detection models in PyOD by leveraging SUOD framework. A benchmark is supplied for select algorithms to provide an overview of the implemented models. In total, 17 benchmark datasets are used for comparison, which can be downloaded at ODDS. -
15
JavaScript Algo and Data Structures
Algorithms and data structures implemented in JavaScript
javascript-algorithms is an open source repository by Oleksii Trekhleb that provides implementations of algorithms and data structures in JavaScript. Each algorithm includes explanations, complexity analysis, and references for further reading, making it both a coding resource and a study guide. The repository covers topics such as sorting, searching, graph algorithms, cryptography, and data structures like linked lists, stacks, and queues. -
16
DomainBed
DomainBed is a suite to test domain generalization algorithms
DomainBed is a PyTorch-based research suite created by Facebook Research for benchmarking and evaluating domain generalization algorithms. It provides a unified framework for comparing methods that aim to train models capable of performing well across unseen domains, as introduced in the paper In Search of Lost Domain Generalization. The library includes a wide range of well-known domain generalization algorithms, from classical baselines such as Empirical Risk Minimization (ERM) and Invariant Risk Minimization (IRM) to more advanced techniques like Domain Adversarial Neural Networks (DANN), Adaptive Risk Minimization (ARM), and Invariance Principle Meets Information Bottleneck (IB-ERM/IB-IRM). ... -
17
trackers
Multi-object tracking algorithms
trackers is a plug-and-play multi-object tracking library designed to work with virtually any object detection model, enabling developers to follow objects across video frames with minimal setup. The library provides clean, modular implementations of leading tracking algorithms and can be used either from the command line or embedded directly into Python pipelines. It supports inputs such as videos, webcams, RTSP streams, or image directories and produces annotated tracking outputs that include labels and trajectories. Trackers is built for flexibility and benchmarking, allowing users to evaluate performance using standard multi-object tracking metrics and compare algorithms easily. ... -
18
PyMC3
Probabilistic programming in Python
...Variational inference saves computational cost by turning a problem of integration into one of optimization. PyMC3's variational API supports a number of cutting edge algorithms, as well as minibatch for scaling to large datasets. -
19
bild
Image processing algorithms in pure Go
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. -
20
The NLopt module for Julia
Package to call the NLopt nonlinear-optimization library from Julia
This module provides a Julia-language interface to the free/open-source NLopt library for nonlinear optimization. NLopt provides a common interface for many different optimization algorithms. -
21
Homemade Machine Learning
Python examples of popular machine learning algorithms
...The purpose is pedagogical: you’ll see linear regression, logistic regression, k-means clustering, neural nets, decision trees, etc., built in Python using fundamentals like NumPy and Matplotlib, not hidden behind API calls. It is well suited for learners who want to move beyond library usage to understand how algorithms operate internally—how cost functions, gradients, updates and predictions work. -
22
Gen.jl
A general-purpose probabilistic programming system
An open-source stack for generative modeling and probabilistic inference. Gen’s inference library gives users building blocks for writing efficient probabilistic inference algorithms that are tailored to their models, while automating the tricky math and the low-level implementation details. Gen helps users write hybrid algorithms that combine neural networks, variational inference, sequential Monte Carlo samplers, and Markov chain Monte Carlo. Gen features an easy-to-use modeling language for writing down generative models, inference models, variational families, and proposal distributions using ordinary code. ... -
23
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
...An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
24
tqdm
A Fast, Extensible Progress Bar for Python and CLI
...Just by inserting tqdm (or python -m tqdm) between pipes will pass through all stdin to stdout while printing progress to stderr. tqdm does not require any dependencies, has a very low overhead and uses smart algorithms to predict the remaining time and skip unnecessary iteration displays. It works on just about any platform, console or in a GUI, as well as IPython/Jupyter notebooks. -
25
ngraph.path
Path finding in a graph
ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. ...
