Search Results for "graph algorithms" - Page 3
Sort By:
Showing 197 open source projects for "graph algorithms"
View related business solutions-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
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.
-
1
RootGraph
Graphic interface with algorithms to compute line and root graphs
Simple and intuitive graphic interface for graph theory with algorithms to compute line and root graphs of a given graph. - Double click to add a new node. - Left click a node and drag to change the position of the node. - Select a node with left click and add an edge with the next node you select. - Right click a node to delete it. Made in C++ using the wxWidgets library. -
2
DIG
A library for graph deep learning research
...If you are working or plan to work on research in graph deep learning, DIG enables you to develop your own methods within our extensible framework, and compare with current baseline methods using common datasets and evaluation metrics without extra efforts. It includes unified implementations of data interfaces, common algorithms, and evaluation metrics for several advanced tasks. Our goal is to enable researchers to easily implement and benchmark algorithms. -
3
Algorithms Math Models
MATLAB implementations of algorithms
Algorithms_MathModels is a large MATLAB collection of algorithms and solved examples targeted at students and teams preparing for mathematical modeling competitions (national and international contests like MCM/ICM). The repository gathers implementations and case studies across many topics commonly used in contest solutions: optimization (linear, integer, goal and nonlinear programming), heuristic and metaheuristic methods (simulated annealing, genetic algorithms, immune algorithms), neural networks and time-series methods, interpolation and regression, graph theory, cellular automata, grey systems, fuzzy models, partial/ordinary differential equations, and multivariate analysis, among others. ... -
4
Atomix
A Kubernetes toolkit for building distributed applications
Atomix is a cloud-native runtime for building stateful, scalable, configurable, and reliable distributed applications in Kubernetes. The Atomix API provides a set of high-level building blocks (referred to as distributed primitives) for building distributed systems. The architecture of Atomix incorporates the lessons learned from experience over the past decade of building high-availability cloud infrastructure. The primary focus of the project is to decouple applications from specific data... -
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
Pattern
Web mining module for Python, with tools for scraping
Pattern is an open-source Python library that provides tools for web mining, natural language processing, machine learning, and network analysis. The project integrates multiple capabilities into a single framework that allows developers to collect, process, and analyze textual data from the web. It includes modules for web scraping and crawling that can retrieve information from sources such as social media platforms, search engines, and online knowledge bases. In addition to data mining... -
6
This is a method for identifying graphs using MD5 hashing. It can be used for graph equality comparisons and to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled.
-
7
kotlin-utils
Helpful extra utils for the kotlin-std library.
The second library is Binary Streams. The library is intended for I/O on Kotlin language. -
8
Machine Learning PyTorch Scikit-Learn
Code Repository for Machine Learning with PyTorch and Scikit-Learn
Initially, this project started as the 4th edition of Python Machine Learning. However, after putting so much passion and hard work into the changes and new topics, we thought it deserved a new title. So, what’s new? There are many contents and additions, including the switch from TensorFlow to PyTorch, new chapters on graph neural networks and transformers, a new section on gradient boosting, and many more that I will detail in a separate blog post. For those who are interested in knowing... -
9
TensorNetwork
A library for easy and efficient manipulation of tensor networks
TensorNetwork is a high-level library for building and contracting tensor networks—graphical factorizations of large tensors that underpin many algorithms in physics and machine learning. It abstracts networks as nodes and edges, then compiles efficient contraction orders across multiple numeric backends so users can focus on model structure rather than index bookkeeping. Common network families (MPS/TT, PEPS, MERA, tree networks) are expressed with concise APIs that encourage... -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
10
CapsGNN
A PyTorch implementation of "Capsule Graph Neural Network"
...Inspired by the Capsule Neural Network (CapsNet), we propose the Capsule Graph Neural Network (CapsGNN), which adopts the concept of capsules to address the weakness in existing GNN-based graph embeddings algorithms. By extracting node features in the form of capsules, routing mechanism can be utilized to capture important information at the graph level. As a result, our model generates multiple embeddings for each graph to capture graph properties from different aspects. -
11
Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).
-
12
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
13
Pytholog
A logic programming tool and a logical database with a RESTful API
Pytholog Tool (Command line & API) An executable tool, built in python, that enables logic programming and prolog syntax through interactive shell that mimics prolog language and / or RESTful API that can be called from other applications. The tool is based on the python library pytholog which can be found here: https://github.com/mnoorfawi/pytholog The tool starts normally from the command line. Let's look at the arguments that can be specified while initiating the tool: $... -
14
StellarGraph
Machine Learning on Graphs
StellarGraph is a Python library for machine learning on graphs and networks. The StellarGraph library offers state-of-the-art algorithms for graph machine learning, making it easy to discover patterns and answer questions about graph-structured data. It can solve many machine learning tasks. Graph-structured data represent entities as nodes (or vertices) and relationships between them as edges (or links), and can include data associated with either as attributes. ... -
15
Delta ML
Deep learning based natural language and speech processing platform
...DELTA aims to provide easy and fast experiences for using, deploying, and developing natural language processing and speech models for both academia and industry use cases. DELTA is mainly implemented using TensorFlow and Python 3. DELTA has been used for developing several state-of-the-art algorithms for publications and delivering real production to serve millions of users. It helps you to train, develop, and deploy NLP and/or speech models. Use configuration files to easily tune parameters and network structures. What you see in training is what you get in serving: all data processing and features extraction are integrated into a model graph. ... -
16
java-string-similarity
Implementation of various string similarity and distance algorithms
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity. A library implementing different string similarity and distance measures. A dozen of algorithms (including Levenshtein edit distance and sibblings, Jaro-Winkler, Longest Common Subsequence, cosine similarity etc.) are currently implemented. -
17
VivaGraph
Graph drawing library for JavaScript
...Its layout algorithms help position nodes in aesthetically pleasing arrangements using force-directed simulations that adjust dynamically as the graph evolves. VivaGraphJS is modular, so you can extend or customize layouts, rendering, and interaction logic to fit specialized applications such as social network analysis, dependency mapping, or knowledge graphs. -
18
Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.
-
19
Deep Learning Drizzle
Drench yourself in Deep Learning, Reinforcement Learning
Drench yourself in Deep Learning, Reinforcement Learning, Machine Learning, Computer Vision, and NLP by learning from these exciting lectures! Optimization courses which form the foundation for ML, DL, RL. Computer Vision courses which are DL & ML heavy. Speech recognition courses which are DL heavy. Structured Courses on Geometric, Graph Neural Networks. Section on Autonomous Vehicles. Section on Computer Graphics with ML/DL focus. -
20
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as... -
21
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. -
22
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. 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. ... -
23
Prolog+CG is a Java implementation of Prolog with extensions implementing a subset of the Conceptual Graph (CG) theory of John Sowa. CGs are first-class datatypes on a par with terms. Object oriented extensions are also included.
-
24
Graph Portal
Software to build web portals using concepts of Graph Theory
Graph Portal allows to organize many types of data so that you can get the information you want in the easiest way possible. There are many use cases for this software, including: building a web portal, creating mind map, wiki, studying graph theory concepts and algorithms,content management etc. The application has built-in Lucene search, custom query, file attachment to nodes etc. -
25
Your basic graph
Graph algorithms and data structures
...The tool is part of a larger library of generic graph algorithms.