Open Source Python Algorithms
Sort By:
Python Algorithms
View 6239 business solutionsBrowse free open source Python Algorithms and projects below. Use the toggles on the left to filter open source Python Algorithms by OS, license, language, programming language, and project status.
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
1
Clipper
Polygon and line clipping and offsetting library (C++, C#, Delphi)
This library is now obsolete and no longer being maintained. It has been superceded by my Clipper2 library - https://github.com/AngusJohnson/Clipper2. -
2
Real-ESRGAN
Real-ESRGAN aims at developing Practical Algorithms
Real-ESRGAN is a highly popular open-source project that provides practical algorithms for general image and video restoration using deep learning-based super-resolution techniques. It extends the original Enhanced Super-Resolution Generative Adversarial Network (ESRGAN) approach by training on synthetic degradations to make results more robust on real-world images, effectively enhancing resolution, reducing noise/artifacts, and reconstructing fine detail in low-quality imagery. The repository includes inference and training scripts, a model zoo with different pretrained models (including general and anime-oriented variants), and support for batch and arbitrary scaling, making it adaptable for diverse enhancement tasks. It emphasizes usability with utilities that handle alpha channels, gray/16-bit images, and tiled inference for large inputs, and can be run via Python scripts or portable executables. -
3
GFPGAN
GFPGAN aims at developing Practical Algorithms
GFPGAN aims at developing Practical Algorithms for Real-world Face Restoration. Colab Demo for GFPGAN; (Another Colab Demo for the original paper model) Online demo: Huggingface (return only the cropped face) Online demo: Replicate.ai (may need to sign in, return the whole image). Online demo: Baseten.co (backed by GPU, returns the whole image). We provide a clean version of GFPGAN, which can run without CUDA extensions. So that it can run in Windows or on CPU mode. GFPGAN aims at developing a Practical Algorithm for Real-world Face Restoration. It leverages rich and diverse priors encapsulated in a pretrained face GAN (e.g., StyleGAN2) for blind face restoration. Add V1.3 model, which produces more natural restoration results, and better results on very low-quality / high-quality inputs. -
4
Free Java Flowchart simulator / interpreter
-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
5
FATE
An industrial grade federated learning framework
FATE (Federated AI Technology Enabler) is the world's first industrial grade federated learning open source framework to enable enterprises and institutions to collaborate on data while protecting data security and privacy. It implements secure computation protocols based on homomorphic encryption and multi-party computation (MPC). Supporting various federated learning scenarios, FATE now provides a host of federated learning algorithms, including logistic regression, tree-based algorithms, deep learning and transfer learning. FATE became open-source in February 2019. FATE TSC was established to lead FATE open-source community, with members from major domestic cloud computing and financial service enterprises. FedAI is a community that helps businesses and organizations build AI models effectively and collaboratively, by using data in accordance with user privacy protection, data security, data confidentiality and government regulations. -
6
YAPF
A formatter for Python files
YAPF is a Python code formatter that automatically rewrites source to match a chosen style, using a clang-format–inspired algorithm to search for the “best” layout under your rules. Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. You can run it as a command-line tool or call it as a library via FormatCode / FormatFile, making it easy to embed in editors, CI, and custom tooling. Styles are highly configurable: start from presets like pep8, google, yapf, or facebook, then override dozens of options in .style.yapf, setup.cfg, or pyproject.toml. It supports recursive directory formatting, line-range formatting, and diff-only output so you can check or fix just the lines you touched. -
7
ImageAI
A python library built to empower developers
ImageAI is an easy-to-use Computer Vision Python library that empowers developers to easily integrate state-of-the-art Artificial Intelligence features into their new and existing applications and systems. It is used by thousands of developers, students, researchers, tutors and experts in corporate organizations around the world. You will find features supported, links to official documentation as well as articles on ImageAI. ImageAI is widely used around the world by professionals, students, research groups and businesses. ImageAI provides API to recognize 1000 different objects in a picture using pre-trained models that were trained on the ImageNet-1000 dataset. The model implementations provided are SqueezeNet, ResNet, InceptionV3 and DenseNet. ImageAI provides API to detect, locate and identify 80 most common objects in everyday life in a picture using pre-trained models that were trained on the COCO Dataset. -
8
Pygorithm
A Python module for learning all major algorithms
A Python module to learn all the major algorithms on the go! Purely for educational purposes. If you are using Python 2.7 use pip instead. Depending on your permissions, you might need to use pip install, user pygorithm to install. To see all the available functions in a module, you can just type help() with the module name as an argument. -
9
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
Python Outlier Detection
A Python toolbox for scalable outlier detection
PyOD is a comprehensive and scalable Python toolkit for detecting outlying objects in multivariate data. This exciting yet challenging field is commonly referred as outlier detection or anomaly detection. PyOD includes more than 30 detection algorithms, from classical LOF (SIGMOD 2000) to the latest COPOD (ICDM 2020) and SUOD (MLSys 2021). Since 2017, PyOD [AZNL19] has been successfully used in numerous academic researches and commercial products [AZHC+21, AZNHL19]. PyOD has multiple neural network-based models, e.g., AutoEncoders, which are implemented in both PyTorch and Tensorflow. 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. -
11
TorBot
Dark Web OSINT Tool
Contributions to this project are always welcome. To add a new feature fork the dev branch and give a pull request when your new feature is tested and complete. If its a new module, it should be put inside the modules directory. The branch name should be your new feature name in the format <Feature_featurename_version(optional)>. On Linux platforms, you can make an executable for TorBot by using the install.sh script. You will need to give the script the correct permissions using chmod +x install.sh Now you can run ./install.sh to create the torBot binary. Run ./torBot to execute the program. Crawl custom domains.(Completed). Check if the link is live.(Completed). Built-in Updater.(Completed). TorBot GUI (In progress). Social Media integration.(not Started). -
12
Active Learning
Framework and examples for active learning with machine learning model
Active Learning is a Python-based research framework developed by Google for experimenting with and benchmarking various active learning algorithms. It provides modular tools for running reproducible experiments across different datasets, sampling strategies, and machine learning models. The system allows researchers to study how models can improve labeling efficiency by selectively querying the most informative data points rather than relying on uniformly sampled training sets. The main experiment runner (run_experiment.py) supports a wide range of configurations, including batch sizes, dataset subsets, model selection, and data preprocessing options. It includes several established active learning strategies such as uncertainty sampling, k-center greedy selection, and bandit-based methods, while also allowing for custom algorithm implementations. The framework integrates with both classical machine learning models (SVM, logistic regression) and neural networks. -
13
Baselines
High-quality implementations of reinforcement learning algorithms
Unlike the other two, openai/baselines is not currently a maintained or prominent repo in the OpenAI organization (and I found no strong reference in OpenAI’s main GitHub). Historically, “baselines” repositories are often used for baseline implementations of reinforcement learning algorithms or reference models (e.g. in the RL domain). If there was an OpenAI “baselines” repo, it might have contained reference implementations for reinforcement learning or model policy baselines to compare new work against. However, I couldn’t locate an active “openai/baselines” in the latest OpenAI repos, so it may have been archived, removed, or merged into other projects. If you meant a different “baselines” (e.g. OpenAI Baselines for reinforcement learning), I can look up that specific one. -
14
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
15
Rank-BM25
A Collection of BM25 Algorithms in Python
A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines. -
16
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. Written primarily in Scala, it shows the architecture of large-scale recommendation systems, including candidate sourcing, ranking, and heuristics. While certain components (such as safety layers, spam detection, or private data) are excluded, the release provides valuable insights into the design of real-world machine learning–driven ranking systems. The project is intended as a reference for researchers, developers, and the public to study, experiment with, and better understand the mechanisms behind social media content. -
17
AlphaTensor
AI discovers faster, efficient algorithms for matrix multiplication
AlphaTensor, developed by Google DeepMind, is the research codebase accompanying the 2022 Nature publication “Discovering faster matrix multiplication algorithms with reinforcement learning.” The project demonstrates how reinforcement learning can be used to automatically discover efficient algorithms for matrix multiplication — a fundamental operation in computer science and numerical computation. The repository is organized into four main components: algorithms, benchmarking, nonequivalence, and recombination. These contain implementations of the discovered matrix multiplication algorithms, tools to benchmark their real-world performance, proofs of nonequivalence among thousands of solutions, and methods for decomposing larger problems into smaller factorizations. Users can explore AlphaTensor’s discovered algorithms interactively using Colab notebooks or Python scripts. -
18
Consistent Depth
We estimate dense, flicker-free, geometrically consistent depth
Consistent Depth is a research project developed by Facebook Research that presents an algorithm for reconstructing dense and geometrically consistent depth information for all pixels in a monocular video. The system builds upon traditional structure-from-motion (SfM) techniques to provide geometric constraints while integrating a convolutional neural network trained for single-image depth estimation. During inference, the model fine-tunes itself to align with the geometric constraints of a specific input video, ensuring stable and realistic depth maps even in less-constrained regions. This approach achieves improved geometric consistency and visual stability compared to prior monocular reconstruction methods. The project can process challenging hand-held video footage, including those with moderate dynamic motion, making it practical for real-world usage. -
19
CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services. The bare essentials for efficient fault-tolerant processing on a cloud!
-
20
Coach
Enables easy experimentation with state of the art algorithms
Coach is a python framework that models the interaction between an agent and an environment in a modular way. With Coach, it is possible to model an agent by combining various building blocks, and training the agent on multiple environments. The available environments allow testing the agent in different fields such as robotics, autonomous driving, games and more. It exposes a set of easy-to-use APIs for experimenting with new RL algorithms and allows simple integration of new environments to solve. Coach collects statistics from the training process and supports advanced visualization techniques for debugging the agent being trained. Coach supports many state-of-the-art reinforcement learning algorithms, which are separated into three main classes - value optimization, policy optimization, and imitation learning. Coach supports a large number of environments which can be solved using reinforcement learning. -
21
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). DomainBed also integrates multiple standard datasets—including RotatedMNIST, PACS, VLCS, Office-Home, DomainNet, and subsets from WILDS—allowing consistent experimentation across image classification tasks. -
22
DualPipe
A bidirectional pipeline parallelism algorithm
DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap with communication. DualPipe addresses that by scheduling micro-batches from both ends of the pipeline in a bidirectional fashion—i.e. some micro-batches flow forward while others flow backward—so that computation on one partition can coincide with communication for another. -
23
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following software pre-installed, TeXLive, The book is built with XeLaTeX, a Unicode friendly version of TeX. You need the GNU make tool, in Debian/Ubuntu like Linux, it can be installed through the apt-get command. -
24
PRML
PRML algorithms implemented in Python
PRML repository is a respected and well-maintained project that implements the foundational algorithms from the famous textbook Pattern Recognition and Machine Learning by Christopher M. Bishop, providing a practical and accessible Python reference for both students and professionals. Rather than just summarizing concepts, the repository includes working code that demonstrates linear regression and classification, kernel methods, neural networks, graphical models, mixture models with EM algorithms, approximate inference, and sequential data methods — all following the book’s structure and notation. 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. -
25
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. For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. Because it’s in pure Python, it’s easy to read and modify, making it accessible even to those with modest programming experience. The repo helps bridge the gap between theoretical algorithm descriptions and real-world code, giving concrete, working implementations that one can study, debug, or extend.
