Data Structures in Langs and Libraries
41Functional Data Structures Chris Okasaki
Introduction•Stacks: A Simple Example•Binary Search Trees: Path Copying•Skew Heaps: Amortization and Lazy Evaluation•Difficulties•Further Reading•Acknowledgments•References
42LEDA, a Platform for Combinatorial and Geometric Computing Stefan Naeher
Introduction•The Structure of LEDA•Data Structures and Data Types•Algorithms•Visualization•Example Programs•Projects Enabled by LEDA•References
43Data Structures in C++ Mark Allen Weiss
Introduction•Basic Containers•Iterators•Additional Components of the STL•Acknowledgments•References
44Data Structures in JDSL Michael T. Goodrich, Roberto Tamassia and Luca Vismara
Introduction•Design Concepts in JDSL•The Architecture of JDSL•A Sample Application•Acknowledgments•References
45Data Structure Visualization John Stasko
Introduction•Value of Data Structure Rendering•Issues in Data Structure Visualization Systems•Existing Research and Systems•Summary and Open Problems•References
46Drawing Trees Sebastian Leipert
Introduction•Preliminaries•Level Layout for Binary Trees•Level Layout for n-ary Trees•Radial Layout•HV-Layout•Acknowledgments•References
47Drawing Graphs Peter Eades and Seok-Hee Hong
Introduction•Preliminaries•Convex Drawing•Symmetric Drawing•Visibility Drawing•Conclusion•References
48Concurrent Data Structures Mark Moir and Nir Shavit
Designing Concurrent Data Structures•Shared Counters and Fetch-and-ϕ Structures•Stacks and Queues•Pools•Linked Lists•Hash Tables•Search Trees•Priority Queues•Summary•References