Search Results for "graph algorithms" - Page 5
Sort By:
Showing 197 open source projects for "graph algorithms"
View related business solutions-
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.
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
1
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.
-
2
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 -
3
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. -
4
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. -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
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.
-
6
DCTV
DUAL CONSTRAINED TV-BASED REGULARIZATION ON GRAPHS
...We use a flexible graph data representation that allows us to generalize the constraint on the projection variable. We show how this new formulation of the TV problem may be solved by means of fast parallel proximal algorithms. On denoising and deblurring examples, the proposed approach is shown not only to perform better than recent TV-based approaches, but also to perform well on arbitrary graphs instead of regular grids. -
7
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,... -
8
Provides a graph layout framework along with a number of layout algorithms implemented in Java. Layout services can be used locally or remotely (through HTTP) from a server. !!! For latest version, please see !!! http://code.google.com/p/chilay
-
9
This program is intended for clustering of nodes in graphs (i.e. dividing nodes of the graph into clusters). Several different genetic algorithms can be used to find the solution.
-
Full-stack observability with actually useful AI | 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.
-
10
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.
-
11
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. -
12
...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.
-
13
Track Animation
A simple application which simulates Disk Scheduling Algorithms.
Track Animation is an easy to use Windows application that simulates the following Disk Scheduling Algorithms : FCFS (First Come First Serve), SJF (Shortest Job First) aka SSTF (Shortest Seek Time First), SCAN (Elevator Algorithm), LOOK, C-SCAN (Circular SCAN) and C-LOOK. This application enables the user to play and pause the simulation after providing the necessary simulation requirements. -
14
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. -
15
Grafoanalizator
Graphanalyzer is an environment for visualization of graphsand process
Graphanalyzer is an environment for visualization of graphsand processes with different algorithms. Program supports about 20 algorithms. Program shows visual result of algorithm. You can solve lot of engineering tasks with Graphanalyzer. Learn more about program Graphanalyzer. Features: 1. About 20 algorithms. 2. Visualization of all the processes of graph processing. 3. Supporting helper function for graph creating as map. 4. -
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
Cgraph simulator is a tool to simulate common graph algorithms like bfs,dfs etc specially designed for algorithm learners. For detailed info visit: http://www.shafaetsplanet.com/cgraph/
-
23
A rudimental route planner consisting of basic graph search algorithms such as greedy, brute force and branch&cut
-
24
C/C++ algorithms and containers, for multi-core CPU platform wholly. task scheduler task graph scheduler distributed queue distributed memory allocation distributed search
-
25
MCGL - the Mace C++ Graph Library - is written in and for C++ and provides the basic graph operations with minimal overhead. The code itself is designed in pursuance of economical memory management and fast operations on graphs.