page611.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 601 行 · 第 1/5 页

<DT>directed<DD><A NAME="tex2html958" HREF="page521.html#48130">Directed Graphs</A>
<DT>directed acyclic<DD><A NAME="tex2html983" HREF="page524.html#48637">Directed Acyclic Graphs</A>
<DT>labeled<DD><A NAME="tex2html992" HREF="page527.html#48934">Labeled Graphs</A>
<DT>sparse<DD><A NAME="tex2html999" HREF="page530.html#49155">Sparse vs. Dense Graphs</A>
<DT>traversal<DD><A NAME="tex2html1015" HREF="page548.html#49906">Graph Traversals</A>
<DT>undirected<DD><A NAME="tex2html989" HREF="page525.html#48786">Undirected Graphs</A>
</DL><DT>graph theory<DD><A NAME="tex2html955" HREF="page519.html#48122">Graphs  and Graph Algorithms</A>
<DT>handle<DD><A NAME="tex2html780" HREF="page430.html#31420">Handles</A>
<DT>harmonic number<DD><A NAME="tex2html21" HREF="page45.html#601">Average Running Times</A>, <A NAME="tex2html27" HREF="page46.html#617">About Harmonic Numbers</A>, <A NAME="tex2html417" HREF="page247.html#13564">Average Case Analysis</A>, <A NAME="tex2html530" HREF="page307.html#18534">Solving The Recurrence-Telescoping</A>, <A NAME="tex2html904" HREF="page495.html#37821">Average Running Time</A>
<DT>harmonic series<DD><A NAME="tex2html26" HREF="page46.html#611">About Harmonic Numbers</A>
<DT>hash function<DD><A NAME="tex2html344" HREF="page208.html#10593">Keys and Hash Functions</A>, <A NAME="tex2html345" HREF="page208.html#10596">Keys and Hash Functions</A>
<DT>hash table<DD><A NAME="tex2html383" HREF="page223.html#10992">Hash Tables</A>
<DT>hashing<DD><DL><DT>division method<DD><A NAME="tex2html349" HREF="page213.html#10612">Division Method</A>
<DT>Fibonacci method<DD><A NAME="tex2html361" HREF="page216.html#10650">Fibonacci Hashing</A>
<DT>middle-square method<DD><A NAME="tex2html351" HREF="page214.html#10620">Middle Square Method</A>
<DT>multiplication method<DD><A NAME="tex2html356" HREF="page215.html#10636">Multiplication Method</A>
</DL><DT>head<DD><A NAME="tex2html134" HREF="page97.html#3447">Singly-Linked Lists</A>
<DT>heap<DD><A NAME="tex2html610" HREF="page352.html#23436">Basics</A>, <A NAME="tex2html751" HREF="page415.html#29781">Garbage Collection and the </A>
<DT>heapify<DD><A NAME="tex2html919" HREF="page500.html#39078">Sorting with a Heap</A>
<DT>heapsort<DD><A NAME="tex2html917" HREF="page500.html#39073">Sorting with a Heap</A>
<DT>height<DD><DL><DT>of a node in a tree<DD><A NAME="tex2html432" HREF="page254.html#14480">More Terminology</A>
<DT>of a tree<DD><A NAME="tex2html433" HREF="page254.html#14482">More Terminology</A>
</DL><DT>heuristic<DD><A NAME="tex2html806" HREF="page446.html#32626">Depth-FirstBranch-and-Bound Solver</A>
<DT>hierarchy<DD><A NAME="tex2html421" HREF="page251.html#14101">Trees</A>
<DT>Horner's rule<DD><A NAME="tex2html11" HREF="page41.html#409">Another example-Horner's Rule</A>, <A NAME="tex2html42" HREF="page52.html#965">Example-Geometric Series Summation Again</A>, <A NAME="tex2html373" HREF="page220.html#10861">Character String Keys</A>
<DT>in-degree<DD><A NAME="tex2html972" HREF="page522.html#48583">Terminology</A>, <A NAME="tex2html1027" HREF="page555.html#50686">Topological Sort</A>
<DT>in-place sorting<DD><A NAME="tex2html882" HREF="page483.html#34438">Insertion Sorting</A>, <A NAME="tex2html911" HREF="page497.html#37876">Selection Sorting</A>
<DT>incident<DD><A NAME="tex2html970" HREF="page522.html#48580">Terminology</A>
<DT>increment<DD><A NAME="tex2html837" HREF="page465.html#33762">Generating Random Numbers</A>
<DT>infix<DD><A NAME="tex2html239" HREF="page144.html#5547">Applications</A>
<DT>infix notation<DD><A NAME="tex2html479" HREF="page264.html#15455">Infix Notation</A>
<DT>inheritance<DD><A NAME="tex2html1152" HREF="page600.html#57193">Derivation and Inheritance</A>
<DL><DT>multiple<DD><A NAME="tex2html1147" HREF="page600.html#57154">Derivation and Inheritance</A>
</DL><DT>inorder traversal<DD><A NAME="tex2html472" HREF="page261.html#15264">Inorder Traversal</A>, <A NAME="tex2html536" HREF="page309.html#18589">Traversing a Search Tree</A>
<DL><DT><I>M</I>-way tree<DD><A NAME="tex2html538" HREF="page309.html#18593">Traversing a Search Tree</A>
</DL><DT>insertion sorting<DD><A NAME="tex2html881" HREF="page483.html#34429">Insertion Sorting</A>
<DL><DT>straight<DD><A NAME="tex2html885" HREF="page484.html#35071">Straight Insertion Sort</A>
</DL><DT>insertion sorts<DD><A NAME="tex2html874" HREF="page482.html#34412">Sorter Class Hierarchy</A>
<DT>instance<DD><A NAME="tex2html1119" HREF="page592.html#56930">InstancesInstance Attributes and </A>
<DT>instance attribute<DD><A NAME="tex2html1122" HREF="page592.html#56937">InstancesInstance Attributes and </A>
<DT>internal node<DD><A NAME="tex2html448" HREF="page256.html#14688"><I>N</I>-ary Trees</A>
<DT>internal path length<DD><A NAME="tex2html532" HREF="page308.html#18550">Unsuccessful Search</A>
<DL><DT>complete binary tree<DD><A NAME="tex2html615" HREF="page354.html#23689">Complete Trees</A>
</DL><DT>internal path length of a tree<DD><A NAME="tex2html527" HREF="page306.html#18400">Successful Search</A>
<DT>Internet domain name<DD><A NAME="tex2html375" HREF="page220.html#10877">Character String Keys</A>
<DT>intersection<DD><A NAME="tex2html676" HREF="page386.html#27542">SetsMultisets, and Partitions</A>, <A NAME="tex2html682" HREF="page387.html#27617">Basics</A>, <A NAME="tex2html712" HREF="page399.html#27988">UnionIntersection, and Difference</A>
<DT>interval<DD><DL><DT>search<DD><A NAME="tex2html332" HREF="page193.html#10133">Locating Items in an </A>
</DL><DT>inverse modulo <I>W</I><DD><A NAME="tex2html358" HREF="page215.html#10644">Multiplication Method</A>
<DT>inversion<DD><A NAME="tex2html887" HREF="page486.html#35100">Average Running Time</A>
<DT>isomorphic<DD><A NAME="tex2html441" HREF="page255.html#14664">Alternate Representations for Trees</A>
<DT>isomorphic trees<DD><A NAME="tex2html515" HREF="page296.html#17785">Exercises</A>
<DT>iterative algorithm<DD><A NAME="tex2html97" HREF="page75.html#2083">Example-Fibonacci Numbers</A>
<DT>iterator<DD><A NAME="tex2html206" HREF="page121.html#4585">Iterators</A>
<DT>iterator protocol<DD><A NAME="tex2html207" HREF="page121.html#4589">Iterators</A>
<DT>Java programming language<DD><A NAME="tex2html157" HREF="page112.html#4263">Abstract Data Types</A>
<DT>key<DD><A NAME="tex2html217" HREF="page127.html#4801">Associations</A>, <A NAME="tex2html343" HREF="page208.html#10591">Keys and Hash Functions</A>
<DT>keyed data<DD><A NAME="tex2html379" HREF="page222.html#10974">Using Associations</A>
<DT><code>KeyError</code><DD><A NAME="tex2html152" HREF="page107.html#4003"><tt>extract</tt> Method</A>
<DT>knapsack problem<DD><A NAME="tex2html786" HREF="page438.html#32145">Example-0/1 Knapsack Problem</A>
<DT>Kruskal's algorithm<DD><A NAME="tex2html1072" HREF="page578.html#53597">Kruskal's Algorithm</A>
<DT>L'H&#244;pital's rule<DD><A NAME="tex2html60" HREF="page64.html#1623">About Logarithms</A>, <A NAME="tex2html61" HREF="page64.html#1636">About Logarithms</A>
<DT>labeled graph<DD><A NAME="tex2html991" HREF="page527.html#48933">Labeled Graphs</A>
<DT>lambda<DD>seeload factor
<DT>last-in, first-out<DD><A NAME="tex2html229" HREF="page131.html#5204">Stacks</A>
<DT>latest event time<DD><A NAME="tex2html1085" HREF="page581.html#55487">Application: Critical Path Analysis</A>
<DT>leaf<DD><A NAME="tex2html426" HREF="page253.html#14451">Terminology</A>
<DT>leaf node<DD><A NAME="tex2html455" HREF="page256.html#14886"><I>N</I>-ary Trees</A>
<DT>least-significant-digit-first radix sorting<DD><A NAME="tex2html942" HREF="page514.html#45413">Radix Sort</A>
<DT>left subtree<DD><A NAME="tex2html461" HREF="page257.html#14937">Binary Trees</A>, <A NAME="tex2html520" HREF="page300.html#18013"><I>M</I>-Way Search Trees</A>
<DT>leftist tree<DD><A NAME="tex2html630" HREF="page362.html#25090">Leftist Trees</A>
<DT>level<DD><A NAME="tex2html430" HREF="page254.html#14476">More Terminology</A>
<DT>level-order<DD><A NAME="tex2html619" HREF="page355.html#24007">Complete <I>N</I>-ary Trees</A>
<DT>level-order traversal<DD><A NAME="tex2html269" HREF="page156.html#7039">Applications</A>
<DT>lexicographic order<DD><A NAME="tex2html125" HREF="page90.html#2867">Array Subscript Calculations</A>
<DT>lexicographic ordering<DD><A NAME="tex2html944" HREF="page514.html#46261">Radix Sort</A>
<DT>lexicographically precede<DD><A NAME="tex2html945" HREF="page514.html#46263">Radix Sort</A>
<DT>LGB rule<DD><A NAME="tex2html1112" HREF="page589.html#56888">Scopes and Namespaces</A>
<DT>lifetime<DD><A NAME="tex2html163" HREF="page112.html#4270">Abstract Data Types</A>, <A NAME="tex2html169" HREF="page112.html#4287">Abstract Data Types</A>, <A NAME="tex2html1101" HREF="page586.html#56840">Objects and Types</A>
<DT>LIFO<DD><A NAME="tex2html230" HREF="page131.html#5206">Stacks</A>
<DT>limit<DD><A NAME="tex2html56" HREF="page62.html#1482">Properties of Big Oh</A>
<DT>linear<DD><A NAME="tex2html71" HREF="page67.html#1715">Conventions for Writing Big </A>
<DT>linear congruential random number generator<DD><A NAME="tex2html832" HREF="page465.html#33746">Generating Random Numbers</A>
<DT>linear probing<DD><A NAME="tex2html403" HREF="page239.html#12587">Linear Probing</A>
<DT>linear search<DD><A NAME="tex2html20" HREF="page44.html#510">Yet Another example-Finding the </A>
<DT>linked list<DD><A NAME="tex2html109" HREF="page81.html#2531">Foundational Data Structures</A>
<DT>list<DD><A NAME="tex2html286" HREF="page168.html#8540">Ordered Lists and Sorted </A>
<DT>little oh<DD><A NAME="tex2html80" HREF="page71.html#1900">More Notation-Theta and Little </A>
<DT>live<DD><A NAME="tex2html770" HREF="page425.html#30698">Mark-and-Sweep Garbage Collection</A>
<DT>LL rotation<DD><A NAME="tex2html560" HREF="page326.html#19769">Single Rotations</A>
<DL><DT>in a B-tree<DD><A NAME="tex2html597" HREF="page347.html#22070">Removing Items from a </A>
</DL><DT>load factor<DD><A NAME="tex2html389" HREF="page229.html#11373">Average Case Analysis</A>
<DT>local scope<DD><A NAME="tex2html1105" HREF="page589.html#56877">Scopes and Namespaces</A>
<DT>log squared<DD><A NAME="tex2html70" HREF="page67.html#1714">Conventions for Writing Big </A>
<DT>logarithm<DD><A NAME="tex2html69" HREF="page67.html#1713">Conventions for Writing Big </A>
<DT>long integer<DD><A NAME="tex2html4" HREF="page38.html#324">The Basic Axioms</A>
<DT>loop<DD><A NAME="tex2html978" HREF="page523.html#48622">More Terminology</A>
<DT>loose asymptotic bound<DD><A NAME="tex2html81" HREF="page71.html#1906">More Notation-Theta and Little </A>
<DT>LR rotation<DD><A NAME="tex2html569" HREF="page327.html#20290">Double Rotations</A>
<DT> <IMG WIDTH=9 HEIGHT=11 ALIGN=BOTTOM ALT="tex2html_wrap60767" SRC="img677.gif"  > ukasiewicz, Jan<DD><A NAME="tex2html243" HREF="page144.html#5557">Applications</A>
<DT><I>M</I>-way search tree<DD><A NAME="tex2html517" HREF="page300.html#18000"><I>M</I>-Way Search Trees</A>
<DT>mantissa<DD><A NAME="tex2html367" HREF="page219.html#10779">Floating-Point Keys</A>
<DT>many-to-one mapping<DD><A NAME="tex2html346" HREF="page208.html#10598">Keys and Hash Functions</A>
<DT>mark-and-compact garbage collection<DD><A NAME="tex2html776" HREF="page429.html#31413">Mark-and-Compact Garbage Collection</A>
<DT>mark-and-sweep garbage collection<DD><A NAME="tex2html766" HREF="page425.html#30690">Mark-and-Sweep Garbage Collection</A>
<DT>matrix<DD><A NAME="tex2html129" HREF="page94.html#3183">Matrices</A>
<DL><DT>adjacency<DD><A NAME="tex2html994" HREF="page529.html#49122">Adjacency Matrices</A>
<DT>sparse<DD><A NAME="tex2html997" HREF="page529.html#49147">Adjacency Matrices</A>
</DL><DT>max-heap<DD><A NAME="tex2html920" HREF="page500.html#39080">Sorting with a Heap</A>
<DT>median<DD><A NAME="tex2html907" HREF="page496.html#37845">Selecting the Pivot</A>
<DT>median-of-three pivot selection<DD><A NAME="tex2html908" HREF="page496.html#37849">Selecting the Pivot</A>
<DT>memory leak<DD><A NAME="tex2html755" HREF="page416.html#29803">What is Garbage?</A>
<DT>merge sort<DD><A NAME="tex2html813" HREF="page451.html#32765">Example-Merge Sorting</A>
<DT>merge sorting<DD><A NAME="tex2html930" HREF="page505.html#42628">Merge Sorting</A>
<DT>merge sorts<DD><A NAME="tex2html877" HREF="page482.html#34415">Sorter Class Hierarchy</A>
<DT>mergeable priority queue<DD><A NAME="tex2html605" HREF="page352.html#23408">Basics</A>
<DT>merging nodes in a B-tree<DD><A NAME="tex2html601" HREF="page347.html#22578">Removing Items from a </A>
<DT>Mersenne primes<DD><A NAME="tex2html843" HREF="page466.html#33786">The Minimal Standard Random </A>
<DT>method<DD><DL><DT>static<DD><A NAME="tex2html1139" HREF="page597.html#57115">Static Methods</A>
</DL><DT>method resolution order<DD><A NAME="tex2html1166" HREF="page606.html#57439">Multiple Inheritance</A>
<DT>middle-square hashing method<DD><A NAME="tex2html350" HREF="page214.html#10619">Middle Square Method</A>
<DT>min heap<DD><A NAME="tex2html611" HREF="page352.html#23437">Basics</A>