GOBLIN Graph Library
Summary
A C++ class library including the whole bunch of standard algorithms in graph optimization and drawing. On top of this, a Tcl/Tk wrapper and a GUI for manipulating and editing of graphs.
Authors
Christian Fremuth-Paeger
Vendor
Source code is available at sourceforge, LGPL licence
Status
incomplete information or not officially approved by the authors
Aims and scope
Mathematical Classification
Keywords
- 1-matchings
- adjacencies
- arcs
- balanced augmentation algorithm
- balanced flow networks
- Bellman-Ford algorithm
- b-flows
- bipartite graphs
- b-matchings
- capacitated b-matchings
- capacity scalign algorithm
- Chinese postman problems
- circulations
- combinatorial optimization
- connected components
- connectivity
- cycle canceling algorithm
- degree-constrained subgraphs
- dense graphs
- digraphs
- Dijkstra algorithm
- drawing
- dual graphs
- Euler cycles
- feasible circulations
- f-factors
- FIFO Label-Correcting algorithm
- Floyd-Warshall algorithm
- graph colouring
- graph composing
- graph optimization
- graphs
- incidences
- maximum edge cuts
- maximum flows
- maximum st-flows
- minimum cost flows
- minimum cost st-flows
- minimum mean cycles
- negative costs
- negative cycles
- network programming
- nodes
- node splitting
- optimization problems
- postman problems
- practical optimization problems
- predecessor labels
- primal-dual algorithm
- shortest paths problems
- sparse graphs
- surface graphs
- T-joins
- triangular graphs
- visualization
- Voronoi diagram