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 ...
For example, in our graph from Figure 18.1, A, B, D is a path from A to D. Notice
that each sequential pair, (A, B) and then (B, D), is an edge. A path in an
undirected graph is bi-directional. For example, A, B, D is the path from A to D but
FIGURE 18.12 An adjacency matrix for an undirected graph For any position (row
, column) in the matrix, that position is true if and only if the edge (vrow, vcoIumn)
is in the graph. Since edges in an undirected graph are bi-directional, if (A, B) is ...
What people are saying - Write a review
17 other sections not shown