## Data Structures and Other Objects Using JavaThis text uses a five-step method for working with data types, to ensure students have a thorough knowledge of the subject and understand the data type abstractly. It also aims to teach students how to use the data type, design and implement it, and analyze the implementation. |

### From inside the book

Results 1-3 of 26

Page 704

Methods for Manipulating

retrieving the label of a

Accessor method to get the label of a

...

Methods for Manipulating

**Vertex**Labels There are two methods for setting andretrieving the label of a

**vertex**: * getLabel public Object getLabel (i nt**vertex**)Accessor method to get the label of a

**vertex**of this Graph. Parameters:**vertex**- a...

Page 712

to prevent going around in circles, never move forward to a marked

drawing, we have highlighted the edge from

intuitive notion of "moving from one

to prevent going around in circles, never move forward to a marked

**vertex**In thedrawing, we have highlighted the edge from

**vertex**0 to**vertex**1 to indicate theintuitive notion of "moving from one

**vertex**to another." From here, the traversal ...Page 732

Or di stance [v] might be infinity, indicating that there is no path from the start

the

following ...

Or di stance [v] might be infinity, indicating that there is no path from the start

**vertex**to**vertex**v. But when di stance [v] is not infinity, we can actually print outthe

**vertices**on the shortest path from the start**vertex**to**vertex**v, using thefollowing ...

### What people are saying - Write a review

User Review - Flag as inappropriate

trtgfhh

### Contents

Chapter | 2 |

LEARNING OBJECTIVES | 14 |

Chapter Summary and Solutions | 38 |

Copyright | |

25 other sections not shown

### Other editions - View all

### Common terms and phrases

Accessor method activated addAll algorithm applet arithmetic overflow array B-tree binary search tree binary tree BTNode Celsius clone method collection class computation constructor contains copy create current element cursor data type digits double numbers empty example expression extended class Figure graph hash table head reference heap heapsort Indicates insufficient memory information hiding initial capacity input IntArrayBag integer IntNode iterator Java Javadoc linked list Location loop manyItems mergesort method returns node null reference number of elements number of operations package parameter position Postcondition pre-order traversal Precondition priority queue private instance variables pseudocode public boolean public class public int public Object public static void public void quicksort recursive call reference variable remove return value returns true root Self-Test Exercises sequence shown simulation specified stack statement step stored string subtree Suppose target Throttle Throws TreeMap vertex vertices write zero