Java Software Structures: Designing and Using Data StructuresThe second edition of Java Software Structures embraces the enhancements of Java 5.0, where all structures and collections are based on generics. The framework of the text walks the reader through three main areas: conceptualization, explanation, and implementation, allowing for a consistent and coherent introduction to data structures. The addition of integrated case studies provides complete examples to aid readers starting with the problem statement, to design rationale, through full implementation. Readers will learn how to develop high-quality software systems using well-designed collections and algorithms. |
From inside the book
Results 1-3 of 14
Page 546
... vertices A and B are adjacent while vertices A and D are not . Adjacent vertices are some- times referred to as neighbors . An edge of a graph that connects a vertex to itself is called a self - loop or a sling . An undirected graph is ...
... vertices A and B are adjacent while vertices A and D are not . Adjacent vertices are some- times referred to as neighbors . An edge of a graph that connects a vertex to itself is called a self - loop or a sling . An undirected graph is ...
Page 557
... vertex , and the weight . We then pick an arbitrary starting vertex ( it does not mat- ter which one ) and add it to our minimum spanning tree ( MST ) . Next we add all of the edges that include our starting vertex to a minheap ordered ...
... vertex , and the weight . We then pick an arbitrary starting vertex ( it does not mat- ter which one ) and add it to our minimum spanning tree ( MST ) . Next we add all of the edges that include our starting vertex to a minheap ordered ...
Page 560
... vertex , weight pairs based upon total weight ( the sum of the weights from the starting vertex to this vertex ) so that we always traverse through the graph following the cheapest path first . For each vertex , we must store the label ...
... vertex , weight pairs based upon total weight ( the sum of the weights from the starting vertex to this vertex ) so that we always traverse through the graph following the cheapest path first . For each vertex , we must store the label ...
Other editions - View all
Java Software Structures: Designing and Using Data Structures John Lewis,Joseph Chase No preview available - 2004 |
Common terms and phrases
abstract data type abstract methods addAll addElement ancestor tree array implementation ArraySet<T AVL tree B-tree binary search tree binary tree BlackJack boolean Card Chapter child class class hierarchy complexity constructor contains count create data structure deck declared defined dequeue disks doubly linked list element stored empty evaluation example exception Figure graph hash table heap ImageIcon inheritance insertion instantiated integer interface invoked isEmpty iterator Java Collections API Key Concept left child Lewis/Chase LIBRARIES linear linked implementation linked list loop ment node null number of elements operand operation parameter parent particular path player position postfix expression problem provides public class public void queue radix sort recursive remove removeRandom represent return result Returns true right child root SAN DIEGO Self-Review Questions set collection sort algorithm stack static String System.out.println throw tion toString traversal UML description undirected graph waterfall model web crawler