Graph drawing and manipulation with LINK

  • Jonathan Berry
  • Nathaniel Dean
  • Mark Goldberg
  • Gregory Shannon
  • Steven Skiena
Methodologies and Applications II
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1353)

Abstract

This paper introduces the LINK system as a flexible tool for the creation, manipulation, and drawing of graphs and hypergraphs. We describe the basic architecture of the system and illustrate its flexibility with several examples. LINK is distinguished from existing software for discrete mathematics by its layered interface, including a graphical user interface tied into an object-oriented Scheme language interface with access to Tk, and an extensible underlying set of C++ libraries. We conclude by briefly discussing roles LINK has played in research and education.

References

  1. 1.
    D. Berque, R. Cecchini, M. Goldberg, and R. Rivenburgh. The setplayer system for symbolic computation on power sets. Journal of Symbolic Computation, 14:645–662, 1992.Google Scholar
  2. 2.
    J. Berry. Improving discrete mathematics and algorithms curricula with LINK. In SIGCSE/SIGCUE Conference on Integrating Technology into Computer Science Education, pages 14–20, 1997.Google Scholar
  3. 3.
    J. Berry and N. Dean. Market basket analysis with LINK. submitted to Congressus Numerantium, 1996.Google Scholar
  4. 4.
    J. Berry, N. Dean, P. Fasel, M. Goldberg, E. Johnson, J. MacCuish, G. Shannon, and S. Skiena. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.Google Scholar
  5. 5.
    G. Cherlin and B. Latka. A decision problem involving tournaments. Technical Report 96-11, Center for Discrete Mathematics and Theoretical Computer Science, 1996.Google Scholar
  6. 6.
    E. Gallesio. The stk reference manual. Technical Report RT 95-31a, I3S CNRS, Université de Nice — Sophia Antipolis, France, 1995.Google Scholar
  7. 7.
    B. Latka. Finitely constrained classes of homogeneous directed graphs. The Journal of Symbolic Logic, 59(1):124–139, March 1994.Google Scholar
  8. 8.
    E. Mäkinen. How to draw a hypergraph. International Journal of Computer Mathematics, 34:177–185, 1990.Google Scholar
  9. 9.
    B. McKay. Nauty user's guide. Technical Report TR-CS-90-02, Australian National University, 1990.Google Scholar
  10. 10.
    K. Mehlhorn and S. Nähger. Leda: A platform for combinatorial and geometric computing. CALM, 38(1):96–102, Jan 1995.Google Scholar
  11. 11.
    M. Mevenkamp, N. Dean, and C. Monma. NETPAD user's guide and reference guide, 1990.Google Scholar
  12. 12.
    J. Ousterhout. Tcl and the Tk Toolkit. Addison-Wesley, 1994.Google Scholar
  13. 13.
    G. Shannon, L. Meeden, and D. Friedman. SchemeGraphs: An object-oriented environment for manipulating graphs, 1990. Software and documentation.Google Scholar
  14. 14.
    S. Skiena. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, 1990.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Jonathan Berry
    • 1
  • Nathaniel Dean
    • 2
  • Mark Goldberg
    • 3
  • Gregory Shannon
    • 4
  • Steven Skiena
    • 5
  1. 1.Elon CollegeUSA
  2. 2.Bell Laboratories InnovationsUSA
  3. 3.Rensselaer Polytechnic InstituteUSA
  4. 4.Milkyway TechnologiesUSA
  5. 5.SUNY Stony BrookUSA

Personalised recommendations