Search Results for "graph algorithms"

Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others....

Visit our new site: http://socnetv.org Social Network Visualizer (SocNetV) is a social network analysis and visualization application. You can draw a social network (graph/digraph) or load an existing one (GraphML, UCINET, Pajek, etc), compute cohesion, centrality, community and structural equivalence metrics and apply various layout algorithms based on actor centrality or prestige scores (i.e. Eigenvector, Betweenness) or on dynamic models (i.e. Kamada-Kawai spring-embedder)

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

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.

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.

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.

A library of graph algorithms non-trivials. An example, chordiallity test, Max-flow, etc...

Graph handling and layout software developed for helping scientific research. The interface uses Perl, the algorithms are in C++. Creates and shows 3D and 2D graph layouts (several algorithms). Has a scripting interface for graph handling.

Not yet playable. jadab is a Dots and Boxes playing program. It uses modern algorithms and graph theory to play the twin game, Strings and Coins. It is being done as a research project in math, game theory, and computer science at Dalhousie University