Search Results for "graph algorithms" - Page 6
Sort By:
Showing 197 open source projects for "graph algorithms"
View related business solutions-
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.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
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
-
2
Read and process a graph file. Use data structures and algorithms to calculate which nodes become to which components.
-
3
Nathalie - an educational algorithm program, with focus on graph algorithms and didactic presentation. As of April 2011 we are finishing the designing phase.
-
4
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.
-
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.
-
5
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.
-
6
An adaptive neural network and evolutionary algorithms approach to the machine learning tasks, based on the modular graph grammars. Tested on the "two spirals problem" and other tasks. Implemented in Matlab and C++.
-
7
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.
-
8
-
9
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
-
Streamline Azure Security with Palo Alto Networks VM-SeriesImprove your security posture and reduce incident response time. Use the VM-Series to natively analyze Azure traffic and dynamically drive policy updates based on workload changes.
-
10
GraphLayout is a utility to draw large graphs (up to 5000 nodes). It allows you to experiment with different cost functions and algorithms. It also has an external utility which needs to measure the graph quality or its topological features.
-
11
Software for graphs visualization, encouraging graph algorithms implementation. Aimed at students who want to code their own algorithms and see a graphical representation of it working.
-
12
Dictionary-tree is a standard dictionary, means a lexicographic tree (acyclic graph), where letters are nodes of tree, starting from root going down to leaves. You can Get and Add words, Clear and Save the whole dictionary. C++ and Pascal.
-
13
TopPlot facilitates the plotting in 2(.5)D of spacial graph projections. TopPlot further provides a visualization system for exploring the graphs in space. Additionally, algorithms are provided (via a plug-in interface) to analyze the graphs.
-
14
A library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a GUI for manipulating and editing of graphs.
-
15
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
-
16
-
17
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
-
18
A basic package that represents graphs along with some basic graph algorithms in Java. The idea is to keep the representation simple, straightforward and documented.
-
19
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
-
20
GrALoG is a tool for editing and visualising graph-like-structures and the results of algorithms running on them. Through it's plugins GrALoG is hugely extendable, i.e. plugin-developers can define their own graph-like structures and algorithms.
-
21
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
-
22
-
23
A Common Lisp library for representing and manipulating graphs. Algorithms implemented: subgraph isomorphism (Ullman), automorphism, canonicalization (Nauty), connected-components/union-find.
-
24
This package is intended to provide a user with the ability to visualise the runtime behaviour of graph and tree based algorithms. It is developed using Qt, C++ and "dot" system. Works on Linux platform.
-
25