page611.html

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

<DT>component<DD><DL><DT>connected<DD><A NAME="tex2html1034" HREF="page559.html#50724">Connectedness of an Undirected </A>
</DL><DT>compound statement<DD><A NAME="tex2html85" HREF="page73.html#1939">Rules For Big Oh </A>
<DT>concrete class<DD><A NAME="tex2html182" HREF="page114.html#4338">Class Hierarchy</A>, <A NAME="tex2html185" HREF="page114.html#4352">Class Hierarchy</A>
<DT>conjunction<DD><A NAME="tex2html675" HREF="page386.html#27540">SetsMultisets, and Partitions</A>
<DT>connected<DD><DL><DT>undirected graph<DD><A NAME="tex2html1031" HREF="page559.html#50716">Connectedness of an Undirected </A>
</DL><DT>connected component<DD><A NAME="tex2html1033" HREF="page559.html#50723">Connectedness of an Undirected </A>, <A NAME="tex2html1095" HREF="page583.html#56186">Exercises</A>
<DT>conquer<DD>seedivide
<DT>constant<DD><A NAME="tex2html68" HREF="page67.html#1712">Conventions for Writing Big </A>
<DT><code>ContainerEmpty</code><DD><A NAME="tex2html145" HREF="page103.html#3891"><tt>first</tt> and <tt>last</tt> Properties</A>
<DT>copy<DD><A NAME="tex2html114" HREF="page85.html#2728"><tt>__copy__</tt> Method</A>
<DL><DT>shallow<DD><A NAME="tex2html115" HREF="page85.html#2729"><tt>__copy__</tt> Method</A>
</DL><DT>counted do loop<DD><A NAME="tex2html86" HREF="page73.html#1979">Rules For Big Oh </A>
<DT>critical activity<DD><A NAME="tex2html1087" HREF="page581.html#55503">Application: Critical Path Analysis</A>
<DT>critical path<DD><A NAME="tex2html1088" HREF="page581.html#55505">Application: Critical Path Analysis</A>
<DT>critical path analysis<DD><A NAME="tex2html1080" HREF="page581.html#54654">Application: Critical Path Analysis</A>
<DT>cubic<DD><A NAME="tex2html73" HREF="page67.html#1717">Conventions for Writing Big </A>
<DT>cycle<DD><A NAME="tex2html977" HREF="page523.html#48619">More Terminology</A>
<DL><DT>negative cost<DD><A NAME="tex2html1046" HREF="page564.html#51604">Single-Source Shortest Path</A>
<DT>simple<DD><A NAME="tex2html980" HREF="page523.html#48625">More Terminology</A>
</DL><DT>dangling pointer<DD><A NAME="tex2html754" HREF="page416.html#29801">What is Garbage?</A>
<DT>dangling reference<DD><A NAME="tex2html753" HREF="page416.html#29800">What is Garbage?</A>
<DT>data ordering property<DD><A NAME="tex2html519" HREF="page300.html#18007"><I>M</I>-Way Search Trees</A>
<DT>database<DD><A NAME="tex2html219" HREF="page127.html#4804">Associations</A>
<DT>decision tree<DD><A NAME="tex2html935" HREF="page510.html#44438">A Lower Bound on </A>
<DT>defragment<DD><A NAME="tex2html771" HREF="page426.html#30961">The Fragmentation Problem</A>
<DT>degree<DD><A NAME="tex2html265" HREF="page156.html#6751">Applications</A>
<DL><DT>in<DD><A NAME="tex2html973" HREF="page522.html#48584">Terminology</A>
<DT>out<DD><A NAME="tex2html969" HREF="page522.html#48578">Terminology</A>
</DL><DT>dense graph<DD><A NAME="tex2html1000" HREF="page530.html#49162">Sparse vs. Dense Graphs</A>
<DT>depth<DD><A NAME="tex2html431" HREF="page254.html#14478">More Terminology</A>
<DT>depth-first spanning tree<DD><A NAME="tex2html1063" HREF="page574.html#52500">Constructing Spanning Trees</A>
<DT>depth-first traversal<DD><A NAME="tex2html793" HREF="page440.html#32437">Example-Balancing Scales</A>, <A NAME="tex2html1017" HREF="page549.html#49909">Depth-First Traversal</A>
<DT>deque<DD><A NAME="tex2html225" HREF="page130.html#5009">StacksQueues, and Deques</A>, <A NAME="tex2html273" HREF="page158.html#7369">Deques</A>
<DT>derivation<DD><A NAME="tex2html190" HREF="page114.html#4363">Class Hierarchy</A>, <A NAME="tex2html1143" HREF="page600.html#57147">Derivation and Inheritance</A>
<DT>derivative<DD><A NAME="tex2html317" HREF="page189.html#9677">Applications</A>
<DT>derived class<DD><A NAME="tex2html1144" HREF="page600.html#57149">Derivation and Inheritance</A>
<DT>descendant<DD><A NAME="tex2html437" HREF="page254.html#14489">More Terminology</A>
<DL><DT>proper<DD><A NAME="tex2html438" HREF="page254.html#14491">More Terminology</A>
</DL><DT>descriptor<DD><A NAME="tex2html202" HREF="page117.html#4459">Abstract Methods</A>
<DT>difference<DD><A NAME="tex2html678" HREF="page386.html#27547">SetsMultisets, and Partitions</A>, <A NAME="tex2html683" HREF="page387.html#27619">Basics</A>, <A NAME="tex2html713" HREF="page399.html#27991">UnionIntersection, and Difference</A>
<DL><DT>symmetric<DD><A NAME="tex2html748" HREF="page413.html#29590">Exercises</A>
</DL><DT>differentiation<DD><A NAME="tex2html318" HREF="page189.html#9679">Applications</A>
<DT>digit<DD><DL><DT>binary<DD><A NAME="tex2html649" HREF="page370.html#26598">Binomial Queues</A>
</DL><DT>digraph<DD>seedirected graph
<DT>Dijkstra's algorithm<DD><A NAME="tex2html1050" HREF="page565.html#51609">Dijkstra's Algorithm</A>
<DT>directed acyclic graph<DD><A NAME="tex2html982" HREF="page524.html#48636">Directed Acyclic Graphs</A>
<DT>directed arc<DD><A NAME="tex2html963" HREF="page522.html#48567">Terminology</A>
<DT>directed graph<DD><A NAME="tex2html957" HREF="page521.html#48129">Directed Graphs</A>
<DT>discrete event simulation<DD><A NAME="tex2html664" HREF="page382.html#27080">Discrete Event Simulation</A>
<DT>disjunction<DD><A NAME="tex2html677" HREF="page386.html#27544">SetsMultisets, and Partitions</A>
<DT>distribution sorting<DD><A NAME="tex2html937" HREF="page511.html#44995">Distribution Sorting</A>
<DT>distribution sorts<DD><A NAME="tex2html878" HREF="page482.html#34416">Sorter Class Hierarchy</A>
<DT>divide and conquer<DD><A NAME="tex2html807" HREF="page448.html#32661">Top-Down Algorithms: Divide-and-Conquer</A>
<DT>division method of hashing<DD><A NAME="tex2html348" HREF="page213.html#10611">Division Method</A>
<DT>double hashing<DD><A NAME="tex2html408" HREF="page241.html#13260">Double Hashing</A>
<DT>double rotation<DD><A NAME="tex2html567" HREF="page327.html#20287">Double Rotations</A>
<DT>double-ended queue<DD><A NAME="tex2html274" HREF="page158.html#7372">Deques</A>
<DT>doubly-linked list<DD><A NAME="tex2html282" HREF="page165.html#7878">Doubly-Linked and Circular Lists</A>
<DT>dual<DD><A NAME="tex2html1082" HREF="page581.html#55248">Application: Critical Path Analysis</A>
<DT>dynamic binding<DD><A NAME="tex2html175" HREF="page112.html#4304">Abstract Data Types</A>
<DT>dynamic programming<DD><A NAME="tex2html817" HREF="page458.html#33092">Bottom-Up Algorithms: Dynamic<BR> Programming</A>
<DT>earliest event time<DD><A NAME="tex2html1084" HREF="page581.html#55477">Application: Critical Path Analysis</A>
<DT>edge<DD><A NAME="tex2html262" HREF="page156.html#6745">Applications</A>, <A NAME="tex2html962" HREF="page522.html#48562">Terminology</A>
<DL><DT>emanate<DD><A NAME="tex2html967" HREF="page522.html#48575">Terminology</A>
<DT>incident<DD><A NAME="tex2html971" HREF="page522.html#48581">Terminology</A>
</DL><DT>element<DD><A NAME="tex2html672" HREF="page386.html#27532">SetsMultisets, and Partitions</A>
<DT>emanate<DD><A NAME="tex2html966" HREF="page522.html#48574">Terminology</A>
<DT>enumeration<DD><A NAME="tex2html222" HREF="page129.html#4925">Projects</A>
<DT>equivalence classes<DD><A NAME="tex2html746" HREF="page412.html#29537">Applications</A>
<DT>equivalence of trees<DD><A NAME="tex2html508" HREF="page293.html#16578">Comparing Trees</A>
<DT>equivalence relation<DD><A NAME="tex2html741" HREF="page412.html#29525">Applications</A>, <A NAME="tex2html1074" HREF="page578.html#53601">Kruskal's Algorithm</A>
<DT>Euler's constant<DD><A NAME="tex2html29" HREF="page46.html#759">About Harmonic Numbers</A>, <A NAME="tex2html531" HREF="page307.html#18537">Solving The Recurrence-Telescoping</A>, <A NAME="tex2html905" HREF="page495.html#37825">Average Running Time</A>
<DT>Euler, Leonhard<DD><A NAME="tex2html642" HREF="page369.html#26549">Binomial Trees</A>
<DT>Eulerian walk<DD><A NAME="tex2html1097" HREF="page583.html#56196">Exercises</A>
<DT>evaluation stack<DD><A NAME="tex2html481" HREF="page266.html#15489">Postfix Notation</A>
<DT>event-node graph<DD><A NAME="tex2html1083" HREF="page581.html#55250">Application: Critical Path Analysis</A>
<DT>exception<DD><A NAME="tex2html146" HREF="page103.html#3892"><tt>first</tt> and <tt>last</tt> Properties</A>, <A NAME="tex2html153" HREF="page107.html#4004"><tt>extract</tt> Method</A>
<DT>exception handler<DD><A NAME="tex2html1170" HREF="page607.html#57453">Exceptions</A>
<DT>exceptions<DD><A NAME="tex2html1168" HREF="page607.html#57449">Exceptions</A>
<DT>exchange sorting<DD><A NAME="tex2html891" HREF="page488.html#35165">Exchange Sorting</A>
<DT>exchange sorts<DD><A NAME="tex2html875" HREF="page482.html#34413">Sorter Class Hierarchy</A>
<DT>exclusive or<DD><A NAME="tex2html374" HREF="page220.html#10866">Character String Keys</A>, <A NAME="tex2html376" HREF="page220.html#10893">Character String Keys</A>
<DT>exponent<DD><A NAME="tex2html369" HREF="page219.html#10783">Floating-Point Keys</A>
<DT>exponential<DD><A NAME="tex2html74" HREF="page67.html#1718">Conventions for Writing Big </A>
<DT>exponential cooling<DD><A NAME="tex2html862" HREF="page474.html#34157">Simulated Annealing</A>
<DT>exponential distribution<DD><A NAME="tex2html853" HREF="page471.html#33929">Exponentially Distributed Random Variables</A>
<DT>expression tree<DD><A NAME="tex2html477" HREF="page263.html#15283">Expression Trees</A>
<DT>extend<DD><A NAME="tex2html1161" HREF="page602.html#57292">Example-Graphical Objects</A>
<DT>external node<DD><A NAME="tex2html447" HREF="page256.html#14686"><I>N</I>-ary Trees</A>
<DT>external path length<DD><A NAME="tex2html534" HREF="page308.html#18553">Unsuccessful Search</A>
<DT>factorial<DD><A NAME="tex2html15" HREF="page42.html#438">Analyzing Recursive Methods</A>
<DT>feasible solution<DD><A NAME="tex2html783" HREF="page436.html#32135">Brute-Force Algorithm</A>
<DT>Fibonacci hashing method<DD><A NAME="tex2html360" HREF="page216.html#10649">Fibonacci Hashing</A>
<DT>Fibonacci number<DD><A NAME="tex2html363" HREF="page216.html#10661">Fibonacci Hashing</A>, <A NAME="tex2html552" HREF="page319.html#19270">AVL Search Trees</A>
<DT>Fibonacci numbers<DD><A NAME="tex2html95" HREF="page75.html#2047">Example-Fibonacci Numbers</A>, <A NAME="tex2html811" HREF="page450.html#32706">Example-Computing Fibonacci Numbers</A>
<DL><DT>closed-form expression<DD><A NAME="tex2html99" HREF="page75.html#2133">Example-Fibonacci Numbers</A>
<DT>generalized<DD><A NAME="tex2html820" HREF="page459.html#33096">Example-Generalized Fibonacci Numbers</A>
</DL><DT>FIFO<DD><A NAME="tex2html252" HREF="page147.html#5964">Queues</A>
<DT>fifo-in, first-out<DD><A NAME="tex2html251" HREF="page147.html#5962">Queues</A>
<DT>find<DD><DL><DT>collapsing<DD><A NAME="tex2html734" HREF="page409.html#29299">Collapsing Find</A>
</DL><DT>floor function<DD><A NAME="tex2html24" HREF="page46.html#629">About Harmonic Numbers</A>
<DT>Floyd's algorithm<DD><A NAME="tex2html1054" HREF="page570.html#52008">Floyd's Algorithm</A>
<DT>forest<DD><A NAME="tex2html638" HREF="page368.html#26010">Binomial Queues</A>, <A NAME="tex2html651" HREF="page370.html#26602">Binomial Queues</A>, <A NAME="tex2html724" HREF="page405.html#28182">Implementing a Partition using </A>
<DT>formal parameter<DD><A NAME="tex2html1117" HREF="page590.html#56911">Parameter Passing</A>
<DT>foundational data structure<DD><A NAME="tex2html110" HREF="page81.html#2533">Foundational Data Structures</A>
<DT>fully connected graph<DD><A NAME="tex2html1094" HREF="page583.html#56182">Exercises</A>
<DT>garbage<DD><A NAME="tex2html756" HREF="page416.html#29805">What is Garbage?</A>
<DT>garbage collection<DD><A NAME="tex2html757" HREF="page416.html#29807">What is Garbage?</A>
<DL><DT>mark-and-compact<DD><A NAME="tex2html777" HREF="page429.html#31414">Mark-and-Compact Garbage Collection</A>
<DT>mark-and-sweep<DD><A NAME="tex2html767" HREF="page425.html#30691">Mark-and-Sweep Garbage Collection</A>
<DT>reference counting<DD><A NAME="tex2html762" HREF="page422.html#29823">Reference Counting Garbage Collection</A>
<DT>stop-and-copy<DD><A NAME="tex2html774" HREF="page427.html#30969">Stop-and-Copy Garbage Collection</A>
</DL><DT>Gauss, Karl Friedrich<DD><A NAME="tex2html643" HREF="page369.html#26550">Binomial Trees</A>
<DT>generalized Fibonacci numbers<DD><A NAME="tex2html819" HREF="page459.html#33095">Example-Generalized Fibonacci Numbers</A>
<DT>geometric series<DD><A NAME="tex2html43" HREF="page53.html#1003">About Geometric Series Summation</A>
<DT>geometric series summation<DD><A NAME="tex2html35" HREF="page50.html#868">An example-Geometric Series Summation</A>, <A NAME="tex2html41" HREF="page52.html#957">Example-Geometric Series Summation Again</A>, <A NAME="tex2html44" HREF="page53.html#1007">About Geometric Series Summation</A>, <A NAME="tex2html51" HREF="page55.html#1137">Example-Geometric Series Summation Yet </A>
<DT>getter<DD><A NAME="tex2html1132" HREF="page595.html#57037">PropertiesAccessors and Mutators</A>
<DT>global scope<DD><A NAME="tex2html1107" HREF="page589.html#56880">Scopes and Namespaces</A>
<DT>golden ratio<DD><A NAME="tex2html362" HREF="page216.html#10652">Fibonacci Hashing</A>
<DT>graph<DD><DL><DT>connectedness<DD><A NAME="tex2html1032" HREF="page559.html#50717">Connectedness of an Undirected </A>
<DT>dense<DD><A NAME="tex2html1001" HREF="page530.html#49163">Sparse vs. Dense Graphs</A>