Data Structures and Algorithms in Java
Using 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.
Results 1-3 of 40
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 ...
9.2.2 The Adjacency List Structure The adjacency list structure for a graph G
extends the edge list structure, adding extra information that supports direct
access to the incident edges (and thus to the adjacent vertices) of each vertex.
While the ...
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 incidence
containers are realized with sequences, which are in turn implemented with
doubly linked lists.
What people are saying - Write a review
LibraryThing ReviewUser Review - daschaich - LibraryThing
Third 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
Stacks Queues and Linked Lists
19 other sections not shown