Search Results for "graph algorithm"
Sort By:
Showing 12 open source projects for "graph algorithm"
View related business solutions-
Paessler - Monitor Your Whole Network in MinutesWaiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
The Algorithms - C++ #
Collection of various algorithms in mathematics, machine learning
TheAlgorithms/C-Plus-Plus is a large open-source repository that collects implementations of many classic algorithms and data structures written in the C++ programming language. The project is part of the broader “The Algorithms” initiative, which maintains algorithm implementations in several programming languages to support education and knowledge sharing. Within the C++ repository, contributors implement algorithms across a wide range of fields including sorting, graph theory, number theory, machine learning, cryptography, and data structures. Each implementation is designed to be readable and well documented so that learners can understand the logic and structure behind each algorithm. -
2
Torch Pruning
DepGraph: Towards Any Structural Pruning
...The library focuses on reducing the size and computational cost of neural networks by removing redundant parameters and channels while maintaining model performance. It introduces a graph-based algorithm called DepGraph that automatically identifies dependencies between layers, allowing parameters to be pruned safely across complex architectures. This dependency analysis makes it possible to prune large networks such as transformers, convolutional networks, and diffusion models without breaking the computational graph. -
3
amrlib
A python library that makes AMR parsing, generation and visualization
...A SpaCy extension that allows direct conversion of SpaCy Docs and Spans to AMR graphs. Sentence to Graph alignment routines FAA_Aligner (Fast_Align Algorithm), based on the ISI aligner code detailed in this paper. RBW_Aligner (Rule Based Word) for a simple, single token to single node alignment. -
4
AI_Tutorial
A selection of learning materials, search, recommendation, advertising
AI_Tutorial is a large curated repository that aggregates high-quality learning resources related to artificial intelligence, machine learning, deep learning, natural language processing, and data engineering. The project functions as a centralized knowledge base designed to help engineers and researchers discover tutorials, technical articles, algorithm explanations, and architecture discussions from across the AI ecosystem. Rather than focusing on a single framework or course, the repository collects materials from many sources such as open-source projects, technical blogs, research papers, and industry engineering posts. The curated content includes topics like recommendation systems, search engine architecture, neural networks, graph neural networks, and modern deep learning techniques. ... -
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.
-
5
Vald
Vald. A Highly Scalable Distributed Vector Search Engine
Vald is a highly scalable distributed fast approximate nearest neighbor dense vector search engine. Vald is designed and implemented based on the Cloud-Native architecture. It uses the fastest ANN Algorithm NGT to search for neighbors. Vald has automatic vector indexing and index backup, and horizontal scaling which is made for searching from billions of feature vector data. Vald is easy to use, feature-rich and highly customizable as you needed. Usually, the graph requires locking during indexing, which causes stop-the-world. But Vald uses distributed index graphs so it continues to work during indexing. ... -
6
The Algorithms - C #
Collection of various algorithms in mathematics, machine learning
...The project is part of the larger “The Algorithms” initiative, which aims to create educational resources by implementing algorithms in multiple programming languages. Within the C repository, contributors implement algorithms from many areas of computer science including sorting, searching, graph processing, mathematics, machine learning, and numerical methods. Each algorithm implementation is written to be readable and well documented so that students and developers can understand how the algorithm works internally. The repository is designed primarily as an educational resource that helps programmers study algorithm design and computational thinking. ... -
7
MACE
Deep learning inference framework optimized for mobile platforms
Graph level memory allocation optimization and buffer reuse are supported. The core library tries to keep minimum external dependencies to keep the library footprint small. -
8
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
...Our platform Easy Machine Learning presents a general-purpose dataflow-based system for easing the process of applying machine learning algorithms to real-world tasks. In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants. -
9
popt4jlib
Parallel Optimization Library for Java
...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today. -
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.
-
10
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
11
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
12
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
- Previous
- You're on page 1
- Next
