Browse 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.

  • Auth0 for AI Agents now in GA Icon
    Auth0 for AI Agents now in GA

    Ready to implement AI with confidence (without sacrificing security)?

    Connect your AI agents to apps and data more securely, give users control over the actions AI agents can perform and the data they can access, and enable human confirmation for critical agent actions.
    Start building today
  • AI-based, Comprehensive Service Management for Businesses and IT Providers Icon
    AI-based, Comprehensive Service Management for Businesses and IT Providers

    Modular solutions for change management, asset management and more

    ChangeGear provides IT staff with the functions required to manage everything from ticketing to incident, change and asset management and more. ChangeGear includes a virtual agent, self-service portals and AI-based features to support analyst and end user productivity.
    Learn More
  • 1
    Clipper

    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.
    Leader badge
    Downloads: 3,478 This Week
    Last Update:
    See Project
  • 2
    GFPGAN

    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.
    Downloads: 51 This Week
    Last Update:
    See Project
  • 3
    Real-ESRGAN

    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.
    Downloads: 23 This Week
    Last Update:
    See Project
  • 4
    ImageAI

    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.
    Downloads: 10 This Week
    Last Update:
    See Project
  • D&B Hoovers is Your Sales Accelerator Icon
    D&B Hoovers is Your Sales Accelerator

    For sales teams that want to accelerate B2B sales with better data

    Speed up sales prospecting with the rich audience targeting capabilities of D&B Hoovers so you can spend more sales time closing.
    Learn More
  • 5
    TorBot

    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).
    Downloads: 7 This Week
    Last Update:
    See Project
  • 6
    MADDPG

    MADDPG

    Code for the MADDPG algorithm from a paper

    MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is the official code release from OpenAI’s paper Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments. The repository implements a multi-agent reinforcement learning algorithm that extends DDPG to scenarios where multiple agents interact in shared environments. Each agent has its own policy, but training uses centralized critics conditioned on the observations and actions of all agents, enabling learning in cooperative, competitive, and mixed settings. The code is built on top of TensorFlow and integrates with the Multiagent Particle Environments (MPE) for benchmarking. Researchers can use it to reproduce the experiments presented in the paper, which demonstrate how agents learn behaviors such as coordination, competition, and communication. Although archived, MADDPG remains a widely cited baseline in multi-agent reinforcement learning research and has inspired further algorithmic developments.
    Downloads: 4 This Week
    Last Update:
    See Project
  • 7
    Active Learning

    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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 8
    YAPF

    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.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 9
    JavaBlock
    Free Java Flowchart simulator / interpreter
    Leader badge
    Downloads: 33 This Week
    Last Update:
    See Project
  • Yeastar: Business Phone System and Unified Communications Icon
    Yeastar: Business Phone System and Unified Communications

    Go beyond just a PBX with all communications integrated as one.

    User-friendly, optimized, and scalable, the Yeastar P-Series Phone System redefines business connectivity by bringing together calling, meetings, omnichannel messaging, and integrations in one simple platform—removing the limitations of distance, platforms, and systems.
    Learn More
  • 10
    AlphaTensor

    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 11
    Binarytree

    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 12
    Consistent Depth

    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 13
    DomainBed

    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.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 14
    The Algorithms Python

    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. The project covers various domains including mathematics, cryptography, machine learning, sorting, graph theory, and more. With contributions from a large global community, it continually grows and improves through collaboration and peer review. This repository is an ideal reference for students, educators, and developers seeking hands-on experience with algorithmic concepts in Python.
    Downloads: 1 This Week
    Last Update:
    See Project
  • 15
    ZHSoftware

    ZHSoftware

    ZHSoftware

    ZH软件&源码库
    Downloads: 6 This Week
    Last Update:
    See Project
  • 16
    Modular toolkit for Data Processing MDP
    The Modular toolkit for Data Processing (MDP) is a Python data processing framework. From the user's perspective, MDP is a collection of supervised and unsupervised learning algorithms and other data processing units that can be combined into data processing sequences and more complex feed-forward network architectures. From the scientific developer's perspective, MDP is a modular framework, which can easily be expanded. The implementation of new algorithms is easy and intuitive. The new implemented units are then automatically integrated with the rest of the library. The base of available algorithms is steadily increasing and includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 17
    A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.
    Downloads: 3 This Week
    Last Update:
    See Project
  • 18
    CloudI: A Cloud at the lowest level
    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!
    Downloads: 2 This Week
    Last Update:
    See Project
  • 19
    Digraph3

    Digraph3

    A collection of python3 modules for Algorithmic Decision Theory

    This collection of Python3 modules provides a large range of implemented decision aiding algorithms useful in the field of outranking digraphs based Multiple Criteria Decision Aid (MCDA), especially best choice, linear ranking and absolute or relative rating algorithms with multiple incommensurable criteria. Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs.
    Downloads: 2 This Week
    Last Update:
    See Project
  • 20
    Sorting-Visualizer

    Sorting-Visualizer

    A GUI sorting visualizer desktop application

    A GUI sorting visualizer desktop application that helps to visualize various sorting algorithms interactively. Visualizer the sorting algorithms like Bubble sort, Insertion sort, Selection sort, Gnome sort, Shaker sort and Odd even sort. Change the bar color and background by customizing. Increase or decrease speed of animation to visualize the sorting process. Download now!
    Downloads: 2 This Week
    Last Update:
    See Project
  • 21
    DEBay

    DEBay

    Deconvolutes qPCR data to estimate cell-type-specific gene expression

    DEBay: Deconvolution of Ensemble through Bayes-approach DEBay estimates cell type-specific gene expression by deconvolution of quantitative PCR data of a mixed population. It will be useful in experiments where the segregation of different cell types in a sample is arduous, but the proportion of different cell types in the sample can be measured. DEBay uses the population distribution data and the qPCR data to calculate the relative expression of the target gene in different cell types in the sample. The user manual of DEBay: https://sourceforge.net/projects/debay/files/UserManual.pdf Sample data: https://sourceforge.net/projects/debay/files/Test_data/ Citation Information: Vimalathithan Devaraj, Biplab Bose. DEBay: A computational tool for deconvolution of quantitative PCR data for estimation of cell type-specific gene expression in a mixed population. Heliyon, 2020, 6(7), e04489. https://doi.org/10.1016/j.heliyon.2020.e04489
    Downloads: 1 This Week
    Last Update:
    See Project
  • 22
    3D Box rotation

    3D Box rotation

    Simple example of draw and rotate 3D box

    Simple source .java file; .bat for fast re-compile and run; and pre-compiled .jar Java program with example from scratch writed in Notepad++ without Eclipse, etc., How to draw and rotate 3D box most simple way. Rotation speed regulated in simple Loop with 10 ms sleep. Use Java version 8 (OpenJDK 8, OracleJDK 8, OracleJRE 8, ..). Higher versions have an anti-aliasing error in the BufferedImage ( Windows 10 ). Python version with tkinter and math imports. Including calculated faces, moving lights and shadows only with CPU.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 23
    Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 24
    The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 25
    Algorithms in Python

    Algorithms in Python

    Data Structures and Algorithms in Python

    Algorithms in Python is a collection of algorithm and data structure implementations (primarily in Python) meant to serve as both learning material and reference code for engineers. It includes code for graph algorithms, heap data structures, stacks, queues, and more — each implemented cleanly so learners can trace logic and adapt for their problems. The repository is particularly useful for people preparing for competitive programming, job interviews, or building a foundational understanding of algorithmic patterns. Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. It also serves as a playground where you can add problems, measure performance, and compare different algorithmic approaches. For anyone striving to move from “I know the syntax” to “I know how to use the right algorithm at the right time,” this repository is a practical asset.
    Downloads: 0 This Week
    Last Update:
    See Project