## Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |

### From inside the book

Results 1-3 of 40

Page 352

9.2 Data Structures for Graphs There are several ways to realize the graph ADT

with a concrete data structure. In this section, we discuss three popular

approaches, usually referred to as the edge

9.2 Data Structures for Graphs There are several ways to realize the graph ADT

with a concrete data structure. In this section, we discuss three popular

approaches, usually referred to as the edge

**list structure**, the adjacency**list****structure**, and ...Page 356

9.2.2 The Adjacency

extends the edge

access to the incident edges (and thus to the adjacent vertices) of each vertex.

While the ...

9.2.2 The Adjacency

**List Structure**The adjacency**list structure**for a graph Gextends the edge

**list structure**, adding extra information that supports directaccess to the incident edges (and thus to the adjacent vertices) of each vertex.

While the ...

Page 358

Table 9.2: Running times for the methods of a graph implemented with an

adjacency

containers are realized with sequences, which are in turn implemented with

doubly linked lists.

Table 9.2: Running times for the methods of a graph implemented with an

adjacency

**list structure**such that containers V and E and the incidencecontainers are realized with sequences, which are in turn implemented with

doubly linked lists.

### What people are saying - Write a review

#### LibraryThing Review

User Review - daschaich - LibraryThingThird edition is much improved: When I learned that this was the required book for my introductory data structures class this semester, I was somewhat worried by the large number of very negative ... Read full review

### Contents

Analysis Tools | 30 |

Stacks Queues and Linked Lists | 66 |

Sequences | 114 |

Copyright | |

19 other sections not shown

### Common terms and phrases

abstract data type analysis applet array asymptotic AVL tree binary search tree binary tree block boolean called chapter Code Fragment constant constructor container data structure defined deletion denote deque describe dictionary doubly linked list edges efficient empty enumeration Euler tour example executed external Figure function given hash heap height Input insertion instance variables integer interface internal node isEmpty iteration Java implementation Java Virtual Machine justification list structure loop memory merge-sort method methpo number of elements object-oriented design Output path perform position postorder traversal preorder traversal primitive operations priority queue problem Proposition protected void pseudo-code public class public void query queue ADT quick-sort random recursive red-black tree reference remove running Section sequence ADT shown in Code singly linked list skip list specific splay splay tree stack string structures and algorithms subtree rooted update vertex vertices worst-case