GOBLIN Graph Library 2.8 Beta 27

A C++ class library focussed on graph optimization and network programming problems.

  Add it to your Download Basket!

 Add it to your Watch List!

0/5

Rate it!

What's new in GOBLIN Graph Library 2.8 Beta 27:

  • This release addresses perfect graphs: a linear test for chordality and co-chordality has been added.
  • Constructors for permutation, threshold, and interval graphs are also available.
  • BFS, the max-flow code, and non-weighted matching code have been revised, and now operate on the node color register (integer) instead of the node distance labels.
Read full changelog
send us
an update
LICENSE TYPE:
LGPL (GNU Lesser General Public License) 
USER RATING:
2.1/5 28
DEVELOPED BY:
Christian Fremuth-Paeger
HOMEPAGE:
www.math.uni-augsburg.de
CATEGORY:
ROOT \ Science and Engineering \ Visualization
2 GOBLIN Graph Library Screenshots:
GOBLIN Graph LibraryGOBLIN Graph Library
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.

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.

Last updated on February 13th, 2009

feature list

#GOBLIN library #graph library #image manipulation #GOBLIN #graph #library #images

Add your review!

SUBMIT