Search Results for "edmonds-karp algorithm implementation in python"
Sort By:
Showing 55 open source projects for "edmonds-karp algorithm implementation in python"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
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.
-
1
MiniSom
MiniSom is a minimalistic implementation of the Self Organizing Maps
MiniSom is a minimalistic and Numpy-based implementation of the Self Organizing Maps (SOM). SOM is a type of Artificial Neural Network able to convert complex, nonlinear statistical relationships between high-dimensional data items into simple geometric relationships on a low-dimensional display. Minisom is designed to allow researchers to easily build on top of it and to give students the ability to quickly grasp its details. The project initially aimed for a minimalistic implementation of... -
2
ML-NLP
This project is a common knowledge point and code implementation
ML-NLP is a large open-source repository that collects theoretical knowledge, practical explanations, and code examples related to machine learning, deep learning, and natural language processing. The project is designed primarily as a learning resource for algorithm engineers and students preparing for technical interviews in machine learning or NLP roles. It compiles important concepts that frequently appear in machine learning discussions, including neural network architectures, training... -
3
deep-q-learning
Minimal Deep Q Learning (DQN & DDQN) implementations in Keras
The deep-q-learning repository authored by keon provides a Python-based implementation of the Deep Q-Learning algorithm — a cornerstone method in reinforcement learning. It implements the core logic needed to train an agent using Q-learning with neural networks (i.e. approximating Q-values via deep nets), setting up environment interaction loops, experience replay, network updates, and policy behavior. -
4
DreamerV3
Mastering Diverse Domains through World Models
DreamerV3 is an open-source implementation of a reinforcement learning algorithm that uses world models to train intelligent agents capable of learning complex behaviors across many environments. The system works by building an internal model of the environment and then using that model to simulate possible future outcomes of actions, allowing the agent to learn from imagined experiences rather than only from real interactions. This approach enables the algorithm to efficiently learn... -
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.
-
5
AIDE ML
AI-Driven Exploration in the Space of Code
AIDE ML is an open-source research framework designed to explore automated machine learning development through agent-based search and code optimization. The project implements the AIDE algorithm, which uses a tree-search strategy guided by large language models to iteratively generate, evaluate, and refine code. Instead of relying on manual experimentation, the agent autonomously drafts machine learning pipelines, debugs errors, and benchmarks performance against user-defined evaluation metrics. The system repeatedly improves its generated code by exploring different implementation paths and selecting the best-performing solutions. ... -
6
LightZero
[NeurIPS 2023 Spotlight] LightZero
LightZero is an efficient, scalable, and open-source framework implementing MuZero, a powerful model-based reinforcement learning algorithm that learns to predict rewards and transitions without explicit environment models. Developed by OpenDILab, LightZero focuses on providing a highly optimized and user-friendly platform for both academic research and industrial applications of MuZero and similar algorithms. -
7
openTSNE
Extensible, parallel implementations of t-SNE
openTSNE is a modular Python implementation of t-Distributed Stochasitc Neighbor Embedding (t-SNE) [1], a popular dimensionality-reduction algorithm for visualizing high-dimensional data sets. openTSNE incorporates the latest improvements to the t-SNE algorithm, including the ability to add new data points to existing embeddings [2], massive speed improvements [3] [4] [5], enabling t-SNE to scale to millions of data points, and various tricks to improve the global alignment of the resulting visualizations. -
8
EPLB
Expert Parallelism Load Balancer
EPLB is DeepSeek’s open implementation of a load balancing algorithm designed for expert parallelism (EP) settings in MoE architectures. In EP, different “experts” are mapped to different GPUs or nodes, so load imbalance becomes a performance bottleneck if certain experts are invoked much more often. EPLB solves this by duplicating heavily used experts (redundancy) and then placing those duplicates across GPUs to even out computational load. It uses policies like hierarchical load balancing... -
9
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... -
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
HDBSCAN
A high performance implementation of HDBSCAN clustering
HDBSCAN - Hierarchical Density-Based Spatial Clustering of Applications with Noise. Performs DBSCAN over varying epsilon values and integrates the result to find a clustering that gives the best stability over epsilon. This allows HDBSCAN to find clusters of varying densities (unlike DBSCAN), and be more robust to parameter selection. In practice this means that HDBSCAN returns a good clustering straight away with little or no parameter tuning -- and the primary parameter, minimum cluster... -
11
Bayesian Optimization
Python implementation of global optimization with gaussian processes
This is a constrained global optimization package built upon bayesian inference and gaussian process, that attempts to find the maximum value of an unknown function in as few iterations as possible. This technique is particularly suited for optimization of high cost functions, situations where the balance between exploration and exploitation is important. More detailed information, other advanced features, and tips on usage/implementation can be found in the examples folder. Follow the basic... -
12
MemU
MemU is an open-source memory framework for AI companions
MemU is an agentic memory layer for LLM applications, specifically designed for AI companions. Transform your memory into an intelligent file system that automatically organizes, connects, and evolves with your memories. Simple, fast, and reliable memory infrastructure for AI applications. Powerful tools and dedicated support to scale your AI applications with confidence. Full proprietary features, commercial usage rights, and white-labeling options for your enterprise needs. SSO/RBAC... -
13
Imagen - Pytorch
Implementation of Imagen, Google's Text-to-Image Neural Network
Implementation of Imagen, Google's Text-to-Image Neural Network that beats DALL-E2, in Pytorch. It is the new SOTA for text-to-image synthesis. Architecturally, it is actually much simpler than DALL-E2. It consists of a cascading DDPM conditioned on text embeddings from a large pre-trained T5 model (attention network). It also contains dynamic clipping for improved classifier-free guidance, noise level conditioning, and a memory-efficient unit design. It appears neither CLIP nor prior... -
14
TextDistance
Compute distance between sequences
...Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). TextDistance show benchmarks results table for your system and saves libraries priorities into the libraries.json file in TextDistance's folder. This file will be used by text distance for calling the fastest algorithm implementation. Default libraries.json is already included in the package. -
15
RL with PyTorch
Clean, Robust, and Unified PyTorch implementation
RL with PyTorch is a research-oriented repository that provides implementations of deep reinforcement learning algorithms using the PyTorch framework. The project focuses on helping developers and researchers understand reinforcement learning methods by providing clean and reproducible implementations of well-known algorithms. It includes code for popular deep reinforcement learning techniques such as Deep Q-Networks, policy gradient methods, actor-critic architectures, and other modern RL... -
16
libACE
Analytic Gaussian integral kernels using the ACE algorithm.
libACE is a source generator and validation toolkit for analytic Gaussian integral kernels. It generates selected C++ feature libraries and can assemble a combined user-facing distribution with a stable C/C++ ABI. Accompanying coordinate expansion (ACE) is a computational method in quantum chemistry designed for the rapid evaluation of electron repulsion integrals (ERIs) over Gaussian-type orbitals. Developed by K. Ishida and later extended by Masao Hayami, Junji Seino, and Hiromi... -
17
minbpe
Minimal, clean code for the Byte Pair Encoding (BPE) algorithm
minbpe is a minimal, clean implementation of byte-level Byte Pair Encoding (BPE), the tokenization approach widely used in modern language models. It operates on UTF-8 encoded bytes rather than Unicode characters, which makes it robust to arbitrary text inputs and avoids needing a language-specific character vocabulary. The repository is structured as a teaching-oriented implementation that shows how to train a tokenizer by learning merge rules, then apply those merges to encode text into... -
18
TextGen
textgen, Text Generation models
Implementation of Text Generation models. textgen implements a variety of text generation models, including UDA, GPT2, Seq2Seq, BART, T5, SongNet and other models, out of the box. UDA, non-core word replacement. EDA, simple data augmentation technique: similar words, synonym replacement, random word insertion, deletion, replacement. This project refers to Google's UDA (non-core word replacement) algorithm and EDA algorithm, based on TF-IDF to replace some unimportant words in sentences with... -
19
YoloV3 Implemented in TensorFlow 2.0
YoloV3 Implemented in Tensorflow 2.0
YoloV3 Implemented in TensorFlow 2.0 is built using TensorFlow 2.0. The project provides a modern deep learning implementation of the popular YOLOv3 algorithm, which is widely used for real-time object detection in images and video streams. YOLOv3 works by dividing an image into grid regions and predicting bounding boxes and class probabilities simultaneously, allowing objects to be detected quickly and efficiently. The repository includes training scripts, inference tools, and configuration... -
20
AB3DMOT
Official Python Implementation for "3D Multi-Object Tracking
AB3DMOT is a real-time 3D multi-object tracking framework designed for applications such as autonomous driving and robotics perception. The system processes detection results from 3D object detectors that analyze LiDAR point clouds and uses them to track multiple objects across consecutive frames. Its tracking pipeline relies on a combination of classical algorithms, including a Kalman filter for state estimation and the Hungarian algorithm for data association between detected objects and... -
21
LightFM
A Python implementation of LightFM, a hybrid recommendation algorithm
LightFM is a Python implementation of a number of popular recommendation algorithms for both implicit and explicit feedback, including efficient implementation of BPR and WARP ranking losses. It's easy to use, fast (via multithreaded model estimation), and produces high-quality results. It also makes it possible to incorporate both item and user metadata into the traditional matrix factorization algorithms. It represents each user and item as the sum of the latent representations of their... -
22
minimalRL-pytorch
Implementations of basic RL algorithms with minimal lines of codes
minimalRL is a lightweight reinforcement learning repository that implements several classic algorithms using minimal PyTorch code. The project is designed primarily as an educational resource that demonstrates how reinforcement learning algorithms work internally without the complexity of large frameworks. Each algorithm implementation is contained within a single file and typically ranges from about 100 to 150 lines of code, making it easy for learners to inspect the entire implementation... -
23
CleanRL
High-quality single file implementation of Deep Reinforcement Learning
CleanRL is a Deep Reinforcement Learning library that provides high-quality single-file implementation with research-friendly features. The implementation is clean and simple, yet we can scale it to run thousands of experiments using AWS Batch. CleanRL is not a modular library and therefore it is not meant to be imported. At the cost of duplicate code, we make all implementation details of a DRL algorithm variant easy to understand, so CleanRL comes with its own pros and cons. You should... -
24
Reinforcement-learning
Implementation of Reinforcement Learning Algorithms. Python, OpenAI
Reinforcement-learning is a widely used educational repository that provides implementations, exercises, and solutions for a broad range of reinforcement learning algorithms, designed to complement foundational texts and courses in the field. The project collects popular approaches such as dynamic programming, Monte Carlo methods, temporal difference learning, Q-learning, SARSA, deep Q-networks, and policy gradient techniques, often demonstrated with Python and OpenAI Gym environments so... -
25
MuZero General
A commented and documented implementation of MuZero
muzero-general is an open-source implementation of the MuZero reinforcement learning algorithm introduced by DeepMind. MuZero is a model-based reinforcement learning method that combines neural networks with Monte Carlo Tree Search to learn decision-making policies without requiring explicit knowledge of the environment’s dynamics. The repository provides a well-documented and commented implementation designed primarily for educational purposes. It allows researchers and developers to train...
