Data Structures and Algorithms in JavaUsing a unique multimedia format for learning the fundamentals of data structures and algorithms, this conceptually elegant and innovative text incorporates the object-oriented design paradigm with Java as the implementation language. The result is a learning experience that provides the fundamental intuition and analysis of each structure studied. A Web site complete with Java applications and applets accompanies the text. Includes CD-ROM with... The Microsoft Visual J++ programming environment. |
From inside the book
Results 1-3 of 75
Page 362
... vertex s in G , which we initialize by fixing one end of our string to s and painting s as “ visited . ” The vertex s is now our “ current ” vertex — call our current vertex u . We then traverse G by considering an ( arbitrary ) edge ...
... vertex s in G , which we initialize by fixing one end of our string to s and painting s as “ visited . ” The vertex s is now our “ current ” vertex — call our current vertex u . We then traverse G by considering an ( arbitrary ) edge ...
Page 372
... vertices we can reach without unrolling the string any farther . In this case , we visit , and paint as “ visited , ” the vertices adjacent to the start vertex s — these vertices are placed into level 1. In the second round , we unroll ...
... vertices we can reach without unrolling the string any farther . In this case , we visit , and paint as “ visited , ” the vertices adjacent to the start vertex s — these vertices are placed into level 1. In the second round , we unroll ...
Page 378
... vertex , and nontree edges , which take us to a previously visited vertex . The tree edges form a tree rooted at the starting vertex , called the depth - first search tree , and there are three kinds of nontree edges : • back edges ...
... vertex , and nontree edges , which take us to a previously visited vertex . The tree edges form a tree rooted at the starting vertex , called the depth - first search tree , and there are three kinds of nontree edges : • back edges ...
Common terms and phrases
abstract addition algorithm allows analysis applet applications array associated assume binary tree block called chapter child Code Fragment consider constant container data structure defined deletion denote describe determine dictionary directed discuss edges efficient element empty enumeration equal example executed expression external Figure function give given graph heap height illustrate implementation important Input insertion integer interface internal node iteration Java justification locator loop means memory method Note object operations Output path pattern perform position priority queue problem Proposition protected queue random range rank recursive reference remove represent requires root running search tree sequence shown simple single sorting space specific stack stored string Table takes throw traversal variable vertex vertices visited void