GOBLIN Graph Library 2.8b9
GOBLIN is a C++ class library focussed on graph optimization and network programming problems
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.
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
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
Magda 1.0 (by Michal)
Magda project is a graph drawing application.
Magda (Magda Aesthetic Graph Drawing Application) is an application developed for ma
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
jEdit 4.3 pre8
jEdit is an Open Source text editor written in Java
Surf the Internet in a safer, faster, and easier way with Opera browser
GNU Aspell 0.60.4
GNU Aspell is a Free and Open Source spell checker designed to eventually replace Ispell