Search Results for "graph algorithm"

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...

A spring-based 3D graph layout tool written in Java. Rendering is performed in OpenGL via the JOGL library.

Satsuma is a graph library for .NET, written in C#. Satsuma is an easy-to-use and flexible library, which implements all the necessary graph structures, and the fastest possible graph algorithms. DOCUMENTATION: http://satsumagraph.sourceforge.net/ Satsuma is not a charting library. 'Graph' is used in the mathematical sense here (e.g. nodes connected with arcs). Satsuma is released under the zlib license. This license is very permissive and allows you to use Satsuma for both personal...

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.

C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.

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.

Simple Java Graph is a minimal matrix- and listbased graph implementation. An AStar search algorithm is also available.

A .NET implementation of the Gabow, Kaplan, Tarjan algorithm for testing the uniqueness of a perfect matching in a general graph.

jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.

A minimalistic CASE tool that will allow end-users to analyze their graphs (plain-old graphs, UML diagrams, ERDs, etc.) by applying various graph theory functions to them (such as a shortest path algorithm or a spanning tree algorithm.)

This is a Java implementation of Edmonds' Algorithm (Chu-Liu Algorithm) for finding maximum branchings in a directed graph.