Java Software Structures: Designing and Using Data Structures
The 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.
Results 1-3 of 13
18.1 UNDIRECTED GRAPHS Key Concept An undirected graph is a graph
where the pairings representing the edges Key Concept Two vertices in a graph
are adjacent if there is an edge connecting them. Key Concept An undirected
graph is ...
continues until the final vertex requires no additional edges because all the other
vertices have already been connected to it. Mathematically, this is the summation:
y • _ n(n-1) it 2 A path is a sequence of edges that connects two vertices in a ...
to the predecessor of the target + 1, and if we wish to output the vertices along the
shortest path, we can simply backtrack along the chain of predecessors. The
second possibility for determining the shortest path is to look for the cheapest
What people are saying - Write a review
17 other sections not shown