Search Results for "graph algorithms"

JGraphT is a free Java class library that provides mathematical graph-theory objects and algorithms. JGraphT supports a rich gallery of graphs and is designed to be powerful, extensible, and easy to use.

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

JAGAL provides implementations for directed graphs (weighted and unweighted) and varoius types of transition systems as well as utils for graph traversal and modification. JAGAL builds upon the Java library TOVAL (located at http://sourceforge.net/p/toval). To use JAGAL, make sure the TOVAL library is on the build path. This library uses and encloses jGraphX (https://github.com/jgraph/jgraphx). A documentation for JAGAL can be found under http://doku.telematik.uni-freiburg.de/jagal.

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.

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.

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.

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.

Algorithms to estimate the number of k-colorings of a low-degree graph using samplings from a markov chain are provided.

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.

ballotbox is a java library consist of 36 algorithms derived from 23 Social Choice Rules (Voting Methods). Uses jgrapht graph theory project and it is own Preference class to represent preferences. Includes preference similarity algorithms.

A graph library, developed in Java.

Two Markov-Chain-Monte-Carlo-algorithms ("Glauber Dynamics" and "Flip Dynamics") used for randomly sampling k-colorings of a graph.