Search Results for "graph algorithms" - Page 4
Sort By:
Showing 139 open source projects for "graph algorithms"
View related business solutions-
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.
-
Earn up to 16% annual interest with Nexo.Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
Algorithms & Data Structures in C++
Algorithms & Data structures in C++
An algorithm is represented by a .h file and placed under include. (one .header file per algorithm.) The demo program for the algorithm demonstration is placed under src. (one demo per algorithm.) After the program passes correctly, please initiate Pull Requests, the code is verified and stored in the library, and the new algorithm implementation is published in the README. TAB = 4 space. set ts=4 in vim. Graph output format is Graphviz Dot format. (the output format of the graph is in dot... -
2
HRDAG
Framework for Hierarchical Graph Decomposition
This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets. -
3
Graph-RAT is a database abstraction layer designed to make it easy to use a large library of graph-analysis routines on a database as well as add new kinds of algorithms to data mining.
-
4
Graphal
Graph algorithms interpreter, IDE, debugger, 3D visualizations.
Graphal is an interpreter of a programming language that is mainly oriented to graph algorithms. There is a command line interpreter and a graphical integrated development environment. The IDE contains text editor for programmers, compilation and script output, advanced debugger and visualization window. The progress of the interpreted and debugged graph algorithm can be displayed in 3D scene. -
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
5
-
6
3DScape is the first plug-in which enables three-dimensional network visualization in Cytoscape. 3DScape features include accessing graph appearance, layout algorithm, and animation effects on a series of expression data.
-
7
SPARGEL
An opensource Java graph library. Abandoned, ignore.
...As now, implemented are: * Adjecency graph data structures * Algorithms: SSSP, APSP, Traversal, Min-Cut, Max-Flow, Many types of finding Components * Creating sub graphs, vertice and edge maps that use a function to implement their mapping. Spargel is released under GPLv3 -
8
Web graph compression
web graph compression algorithms implementation
This project contains the implementation of web graph compression algorithms developed in Technical University of Łódź by Institute of Applied Computer Science. -
9
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
...The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown traits. LTS is an improvement on other subgraph mining algorithms because it uses empirical data from the search history of a first pass to help weed out unpromising search directions. This allows a second pass to spend more time investigating promising areas of search to generate the most discriminative subgraphs more quickly than before. -
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.
-
10
KDT provides domain experts with a simple interface to analyze very large graphs quickly and effectively without requiring knowledge of the underlying graph representation or algorithms. It provides a Python interface and can run on clusters.
-
11
Approximate Subgraph Matching Algorithm
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively,... -
12
MGMF: MapReduce-based Graph Mining Framework provides carefully designed frameworks for various graph mining algorithms and it is fast, efficient, and scalable. The implementation of MGMF is available in this website.
-
13
GrAMP
Graph Algorithm in MetaPost
A software tool to make easily graph algorithm illustrations in MetaPost. The resulting MetaPost-files can e.g. be incorporated in LaTeX-documents. -
14
...Calvo, Anindito Aditomo and Luiz Augusto Pizzato (2012), “Using Wikipedia and Conceptual Graph Structures to Generate Questions for Academic Writing Support”, IEEE Transactions on Learning Technologies, vol. 5, no. 3, pp. 251-263.
-
15
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms. -
16
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
17
Intelligent Water Drops Algorithm
Solving optimization problems by the Intelligent Water Drops algorithm
...One attempt is the IWD-CO (IWD for Continuous Optimization) In this project, the focus is to gradually present implemented IWD-based algorithms. -
18
MuLaViTo
A framework for the visualization of multi-layer networks
MuLaViTo is a multi-layer visualization framework which allows to visualize relations between multiple graphs in derived applications. Moreover, it provides helpful means like k-shortest path algorithms, running algorithms in a separate thread, ... -
19
MbPc Pagerank Simulator
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added. -
20
FlockDB
A distributed, fault-tolerant graph database
...It is not a general graph database in the sense of supporting complex multi-hop traversal queries or sophisticated graph algorithms; instead it focuses on the core problem of storing and querying directed edges with attributes such as sort order, state (normal, archived, removed), and position. Edges are stored both in forward and backward directions to facilitate queries in both directions. -
21
JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.
-
22
C/C++ algorithms and containers, for multi-core CPU platform wholly. task scheduler task graph scheduler distributed queue distributed memory allocation distributed search
-
23
TaskGraphGenerator can be used to develop task graphs that are needed for research works in areas of task scheduling.Task graphs are generated based on 4 algorithms.Schedule your code now using our scheduling algorithms*! *Platform : LINUX
-
24
Graphz is a library for manipulating graph data structures. Graphz can be analyzed, using algorithms, such as shortest paths etc. Graphz is written in Java. It is compatible with GWT and can run in the browser as well.
-
25
Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.