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.

Gato (Graph Animation Toolbox): Animate graph algorithms for example for computing shortest paths, minimal spanning trees, maximum flows or maximal cardinality or weight matchings. Create your own animations using the Animated Data Structures (ADS).

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...

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

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.

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.

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.

Python library for a fast and flexible graph data structure.

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.

boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)

Package for general implementation of graphs in Python. Provides generic data structures, graph operators, and common algorithms.

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