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.

The Chemistry Development Kit (CDK) is a scientific, LGPL-ed library for bio- and cheminformatics and computational chemistry written in Java. The main home page of the CDK is now at: http://cdk.github.io

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

Pigale is a graph editor and a C++ algorithm library essentially concerned with planar graphs. This software, particularly intended for graph theoretical research, includes new algorithms based on our recent theoretical researches.

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

Peklo is a graph editor and an environment for visualizing and comparing different algorithms for some graph-theoretic problems, e.g. flows, shortest path, minimum spanning tree.

The Graph Annotation Framework (GrAF) models linguistic annotations using a data model based on Graph theory and algorithms. The GrAF standard is a work product of ISO TC37SC4 Working Group 1. This Java library is NOT part of the GrAF standard and standoff annotation files produced by the library may not be GrAF compliant.

Graph-RAT is a database abstraction layer designed to make it easy to use a large library of graph-analysis routines on a database as well as add new kinds of algorithms to data mining.

...However, different algorithms typically use different input and output data types, are implemented using different technologies, and are demonstrated by application to different biological problems. Because of this, the primary goal of the NAIL project is to provide a straightforward way to use network approaches in the life sciences, and to apply a variety of techniques quickly and easily on the same data.

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.

APSGraph is a C++ object-oriented library for graph data and algorithms. The main objective of this library is to provide a maximum algorithms performance.

FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.

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

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

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.

The "Framework for Implicit Graph Algorithms and Representations by OBDDs" (Figaro) automatically manages experiments with input generator and algorithm plugins. It already contains some generators and algorithms for graph and scheduling problems.

A Java software for 3D visualization of graphs/networks. It implements many graph layout algorithms (such as force-directed methods), graph generators (such as scale-free networks) and graph modifiers. Most functions can be accessed through its GUI.

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)