LINK: A Combinatorics and Graph Theory Workbench for Applications and Research
Jonathan W. Berry, N. Dean, P. Fasel, Matthew H. Goldberg, Erik C. Johnson, J. MacCuish, Gregory E. Shannon, Steven Skiena · 1995
LINK is a set of C++ class libraries that supports applications in discrete mathematics. The libraries include a commandline interpreter and a graphical user interface that allow access to basic data structures such as Sets and Lists, and a graph hierarchy that includes undirected, directed, and "mixed" hypergraphs and graphs. A "mixed" graph may contain both directed and undirected edges. Many standard data structures including arrays, lists, heaps and binary search trees are within a Container hierarchy. Sets and Sequences are supported within a Collection hierarchy. The data structure hierarchies enable the user to experiment with competing data structure implementations, and with more complex and sophisticated data structures. If an algorithm has several possible choices of a data structure to be used, a single object can be created that is templated with the particular data structure desired. LINK also contains a set of graph generators, layout algorithms for hypergraphs and binar...