GOBLIN Graph Library 2.8b9

GOBLIN is a C++ class library focussed on graph optimization and network programming problems

Developer:	Christian Fremuth-Paeger more software by author →
Price:	0.00
License:	GPL (GNU General Public License)
File size:	1312K
Language:
OS:
Rating:	0 /5 (0 votes)
Your vote:
enlarge screenshot

GOBLIN is a C++ class library focussed on graph optimization and network programming problems. GOBLIN Graph Library deals with all of the standard graph optimization problems discussed by textbooks and in courses on combinatorial optimization.

This software package also consists of a shell interpreter which extends the well-known Tcl/Tk language to graph objects and a graph browser and editor tool. Executable solvers are available for practical optimization problems. The graph browser applies for teaching and scientific documentation purposes.

GOBLIN is open source software and licenced by the GNU Lesser Public License (LGPL). That is, GOBLIN may be downloaded, compiled and used for scientific, educational and other purposes free of charge. For details, in particular the statements about redistribution and changes of the source code, observe the LGPL document which is attached to the package.

Here are some key features of "GOBLIN Graph Library":

The gosh interpreter extends the Tcl/Tk scripting language to graph objects in a natural way.

The goblet graph browser and editor tool. Graphical front end to the library.

An open class hierarchy which strictly separates between abstract classes (all mathematical algorithms are defined as methods of abstract classes), implementations (i.e. by incidence lists, adjacency matrices) and logical views (problem transformations).

A generic branch and bound module with several applications to graph optimization.

Logging and tracing functionality which allows to study the various algorithms by examples.

A runtime configuration module controls the selection of mathemetical methods, logging information, and the tracing of data objects.

Compile time configuration module for code optimization.

A file interface which can be easily extended to new problem classes.

Source code for executable solver programs.

Today, GOBLIN provides strongly polynomial algorithms for the following graph optimization problems:

Shortest paths in graphs and digraphs with negative lengths.

Negative cycles and minimum mean cycles.

Strong and 2-connected components.

Minimum spanning trees, arborescences and 1-trees.

Maximum st-flows, feasible circulations and b-flows.

Min-cost st-flows, b-flows and circulations.

Assignment problems of any kind.

1-matchings, b-matchings, capacitated b-matchings, f-factors and degree-constrained subgraphs.

Directed and undirected Chinese postman problems, T-joins.

What's New in This Release:

The orthogonal drawing methods have been extended by some basic layout compaction rules.
tags

graph optimization optimization problems graph browser editor tool source code abstract classes configuration module and editor browser and extends the graph objects goblin graph graph library

Download GOBLIN Graph Library 2.8b9

http://www.math.uni-augsburg.de/~fremuth/goblin.docs/goblin.2.8b9.tgz

Authors software

GOBLIN Graph Library 2.8b9 (by Christian Fremuth-Paeger)
GOBLIN is a C++ class library focussed on graph optimization and network programming problems

Similar software

GOBLIN Graph Library 2.8b9 (by Christian Fremuth-Paeger)
GOBLIN is a C++ class library focussed on graph optimization and network programming problems

Combean 0.1 (by Combean Team)
Combean project is a Java framework for combinatorial structures like graphs or linear programs and optimization algorithms working w

Graph::ModularDecomposition 0.13 (by Andras Salamon)
Graph::ModularDecomposition is a Perl module for modular decomposition of directed graphs.

SYNOPSIS

use Graph::ModularDecom

graph-tool 0.9 (by Tiago de Paula Peixoto)
graph-tool project is a program to help with statistical analysis of graphs.

Here are some key features of "graph tool":
· suppor

Graph::Writer::DrGeo 0.01 (by Kang-min Liu)
Graph::Writer::DrGeo can save the graph output DrGeo scheme script.

SYNOPSIS

my $g = new Graph;

# Add some vertices/edge

Magda 1.0 (by Michal)
Magda project is a graph drawing application.

Magda (Magda Aesthetic Graph Drawing Application) is an application developed for ma

Graphviz 2.8-1 (by John Ellson and Stephen North)
Graphviz - Graph visualization is a way of representing structural information as diagrams of abstract graphs and networks

Big Faceless Graph Library 2.2.4 (by Big Faceless Organization)
The Big Faceless Graph Library is a Java class library for creating graphs and charts

Solaris::Disk::SVM::Graph 0.03 (by J?r?me Fenal)

The Figaro 1.1.0 (by Daniel Sawitzki)
The Figaro project is a framework for implicit graph algorithms and representations by OBDDs.

The "Framework for Implicit Graph Al

Other software in this category

Gabedit 2.0.6 Pre (by Allouche abdul-Rahman)
Gabedit is a Graphical User Interface to Gaussian, Molcas, Molpro and MPQC computational chemistry packages.

Gabedit includes grap

StatCvs-XML 0.9.6 (by StatCvs-XML Team)
StatCvs-XML provides reports about cvs usage based on the cvs log

Veusz 0.10 (by Jeremy Sanders)
Veusz is a scientific plotting package written in Python

Performance Co-Pilot viewer 0.0.2 (by Olivier)
pcpViewer is a 3D viewer of data gathered through the excellent "Performance Co-Pilot" library.

You can see usage of CPU time, net

G System 0.5.1 (by Raphael Langerhorst)
The G System, often simply called "G", is an effort to create exactly this: simulation of evolution