## Java Software Structures: Designing and Using Data StructuresThe second edition of |

### From inside the book

Results 1-3 of 13

Page 546

18.1

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

18.1

**UNDIRECTED GRAPHS**Key Concept An**undirected graph**is a graphwhere 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 ...Page 547

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

since ...

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 butsince ...

Page 562

FIGURE 18.12 An adjacency matrix for an

, column) in the matrix, that position is true if and only if the edge (vrow, vcoIumn)

is in the graph. Since edges in an

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

We haven't found any reviews in the usual places.

### Contents

Software Development | 2 |

ObjectOriented Design | 30 |

Collections | 83 |

Copyright | |

17 other sections not shown

### Other editions - View all

Java Software Structures: Designing & Using Data Structures John Lewis,Joseph Chase No preview available - 2005 |

### Common terms and phrases

abstract add add add addElement ancestor tree array implementation ArrayList AVL tree B-tree binary search tree binary tree boolean button called Card Chapter complexity constructor contains count create data structure deckSet defined dequeue disks doubly linked list element stored empty enqueue example expression tree Figure hash table hashing function heap ImageIcon insertion insertion sort integer interface isEmpty iterator Java Collections API jss2 Key Concept left child Lewis/Chase linear linked implementation linked list loop merge sort method node null number of elements operation ordered list parameter parent path position postfix expression problem provides public class public void queue radix sort rear recursive reference variable remove represent return result Returns true right child root Self-Review Questions set collection sort algorithm stack static String subtree System.out.println target element temp tion toString traversal UML description undirected graph unordered list vertex vertices waterfall model web crawler