This C++ class library is designed specifically to tackle graph optimization and network programming challenges.
GOBLIN is a highly useful C++ class library that is designed specifically for those who are interested in solving graph optimization and network programming problems. This software package is perfect for users who require solutions to all standard graph optimization problems as discussed in popular textbooks and studied in courses on combinatorial optimization.
In addition to the GOBLIN Graph Library, users will also benefit from a shell interpreter that extends the widely-used Tcl/Tk language to graph objects, as well as a graph browser and editor tool. The executable solvers included in this software package are perfect for practical optimization problems, while the graph browser is ideal for teaching and scientific documentation purposes.
Furthermore, GOBLIN is an open source software package that is licensed under the GNU Lesser Public License (LGPL). Users are free to download, compile, and use GOBLIN for scientific, educational and other purposes without any charge. For more information about redistribution and changes to the source code, users are encouraged to review the LGPL document, which is included in the package.
GOBLIN is capable of providing strongly polynomial algorithms for a wide range of graph optimization problems, including 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, and directed and undirected Chinese postman problems and T-joins.
Overall, GOBLIN is an excellent software package that provides a well-rounded solution for optimizing graph problems. Its robust functionality, ease of use, and availability as an open source solution make it highly recommended for users seeking a reliable tool for graph optimization and network programming.
In addition to the GOBLIN Graph Library, users will also benefit from a shell interpreter that extends the widely-used Tcl/Tk language to graph objects, as well as a graph browser and editor tool. The executable solvers included in this software package are perfect for practical optimization problems, while the graph browser is ideal for teaching and scientific documentation purposes.
Furthermore, GOBLIN is an open source software package that is licensed under the GNU Lesser Public License (LGPL). Users are free to download, compile, and use GOBLIN for scientific, educational and other purposes without any charge. For more information about redistribution and changes to the source code, users are encouraged to review the LGPL document, which is included in the package.
GOBLIN is capable of providing strongly polynomial algorithms for a wide range of graph optimization problems, including 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, and directed and undirected Chinese postman problems and T-joins.
Overall, GOBLIN is an excellent software package that provides a well-rounded solution for optimizing graph problems. Its robust functionality, ease of use, and availability as an open source solution make it highly recommended for users seeking a reliable tool for graph optimization and network programming.
What's New
Version 2.8 Beta 27: N/A