GOBLIN is a C++ class library focussed on graph optimization and network programming problems. It 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.

Independent Set (9) |
Network Flow (9) |
Planarity Detection and Embedding (9) |

Traveling Salesman Problem (9) |
Clique (8) |
Edge and Vertex Connectivity (8) |

Eulerian Cycle / Chinese Postman (8) |
Graph Partition (8) |
Steiner Tree (8) |

Vertex Coloring (8) |
Feedback Edge/Vertex Set (7) |
Matching (7) |

Edge Coloring (5) |
Graph Data Structures (5) |

This page last modified on 2008-07-10 . www.algorist.com