index.htm

数据结构词典（英文）

<dt><a href="admissible.html" tppabs="http://hissa.nist.gov/dads/HTML/admissible.html"><em>admissible vertex</em></a> [<strong>D</strong>]
<dt><a href="adt.html" tppabs="http://hissa.nist.gov/dads/HTML/adt.html"><em>ADT</em></a> [<strong>D</strong>]
<dt><a href="adversary.html" tppabs="http://hissa.nist.gov/dads/HTML/adversary.html"><em>adversary</em></a> [<strong>D</strong>]
<dt><a href="algorithm.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithm.html"><em>algorithm</em></a> [<strong>D</strong>]
<dt><a href="algorithBSTW.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithBSTW.html"><em>algorithm BSTW</em></a> [<strong>A</strong>]
<dt><a href="algorithmFGK.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithmFGK.html"><em>algorithm FGK</em></a> [<strong>A</strong>]
<dt><a href="algorithmV.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithmV.html"><em>algorithm V</em></a> [<strong>A</strong>]
<dt><a href="alignment.html" tppabs="http://hissa.nist.gov/dads/HTML/alignment.html"><em>alignment problem</em></a>
<dt><a href="allpairsshrt.html" tppabs="http://hissa.nist.gov/dads/HTML/allpairsshrt.html"><em>all pairs shortest path</em></a> [<strong>P</strong>]
<dt><a href="alphabet.html" tppabs="http://hissa.nist.gov/dads/HTML/alphabet.html"><em>alphabet</em></a> [<strong>D</strong>]
<dt><a href="alphaskipsr.html" tppabs="http://hissa.nist.gov/dads/HTML/alphaskipsr.html"><em>Alpha Skip Search algorithm</em></a> [<strong>A</strong>]
<dt><a href="alterntngpth.html" tppabs="http://hissa.nist.gov/dads/HTML/alterntngpth.html"><em>alternating path</em></a> [<strong>D</strong>]
<dt><a href="alternat.html" tppabs="http://hissa.nist.gov/dads/HTML/alternat.html"><em>alternating selection</em></a>
<dt><a href="alternatngTr.html" tppabs="http://hissa.nist.gov/dads/HTML/alternatngTr.html"><em>alternating Turing machine</em></a> [<strong>D</strong>]
<dt><a href="alternation.html" tppabs="http://hissa.nist.gov/dads/HTML/alternation.html"><em>alternation</em></a> [<strong>D</strong>]
<dt><a href="amortizdcost.html" tppabs="http://hissa.nist.gov/dads/HTML/amortizdcost.html"><em>amortized cost</em></a> [<strong>D</strong>]
<dt><a href="amortizdwrst.html" tppabs="http://hissa.nist.gov/dads/HTML/amortizdwrst.html"><em>amortized worst case</em></a> [<strong>D</strong>]
<dt><a href="ancestor.html" tppabs="http://hissa.nist.gov/dads/HTML/ancestor.html"><em>ancestor</em></a> [<strong>D</strong>]
<dt><a href="and.html" tppabs="http://hissa.nist.gov/dads/HTML/and.html"><em>and</em></a> [<strong>D</strong>]
<dt><a href="ansi.html" tppabs="http://hissa.nist.gov/dads/HTML/ansi.html"><em>ANSI</em></a> [<strong>D</strong>]
<dt><a href="antichain.html" tppabs="http://hissa.nist.gov/dads/HTML/antichain.html"><em>antichain</em></a> [<strong>D</strong>]
<dt><a href="ap.html" tppabs="http://hissa.nist.gov/dads/HTML/ap.html"><em>AP</em></a>
<dt><a href="apostolicocr.html" tppabs="http://hissa.nist.gov/dads/HTML/apostolicocr.html"><em>Apostolico-Crochemore</em></a> [<strong>A</strong>]
<dt><a href="apostolicogi.html" tppabs="http://hissa.nist.gov/dads/HTML/apostolicogi.html"><em>Apostolico-Giancarlo algorithm</em></a> [<strong>A</strong>]
<dt><a href="approxstrmat.html" tppabs="http://hissa.nist.gov/dads/HTML/approxstrmat.html"><em>approximate string match</em></a> [<strong>P</strong>]
<dt><a href="approximatin.html" tppabs="http://hissa.nist.gov/dads/HTML/approximatin.html"><em>approximation algorithm</em></a> [<strong>T</strong>]
<dt><a href="arc.html" tppabs="http://hissa.nist.gov/dads/HTML/arc.html"><em>arc</em></a> [<strong>D</strong>]
<dt><a href="array.html" tppabs="http://hissa.nist.gov/dads/HTML/array.html"><em>array</em></a> [<strong>S</strong>]
<dt><a href="arrayindex.html" tppabs="http://hissa.nist.gov/dads/HTML/arrayindex.html"><em>array index</em></a>
<dt><a href="arraymerg.html" tppabs="http://hissa.nist.gov/dads/HTML/arraymerg.html"><em>array merging</em></a>
<dt><a href="arraysearch.html" tppabs="http://hissa.nist.gov/dads/HTML/arraysearch.html"><em>array search</em></a>
<dt><a href="articultnpnt.html" tppabs="http://hissa.nist.gov/dads/HTML/articultnpnt.html"><em>articulation point</em></a> [<strong>D</strong>]
<dt><a href="articultnvtx.html" tppabs="http://hissa.nist.gov/dads/HTML/articultnvtx.html"><em>articulation vertex</em></a> [<strong>D</strong>]
<dt><a href="assignment.html" tppabs="http://hissa.nist.gov/dads/HTML/assignment.html"><em>assignment problem</em></a> [<strong>P</strong>]
<dt><a href="assoclist.html" tppabs="http://hissa.nist.gov/dads/HTML/assoclist.html"><em>association list</em></a> [<strong>S</strong>]
<dt><a href="associative.html" tppabs="http://hissa.nist.gov/dads/HTML/associative.html"><em>associative</em></a> [<strong>D</strong>]
<dt><a href="assocarray.html" tppabs="http://hissa.nist.gov/dads/HTML/assocarray.html"><em>associative array</em></a> [<strong>S</strong>]
<dt><a href="asymptomatic.html" tppabs="http://hissa.nist.gov/dads/HTML/asymptomatic.html"><em>asymptomatic equipartition property</em></a> [<strong>D</strong>]
<dt><a href="asymptghtbnd.html" tppabs="http://hissa.nist.gov/dads/HTML/asymptghtbnd.html"><em>asymptotically tight</em></a> [<strong>D</strong>]
<dt><a href="asympbound.html" tppabs="http://hissa.nist.gov/dads/HTML/asympbound.html"><em>asymptotic bound</em></a> [<strong>D</strong>]
<dt><a href="asymplowrbnd.html" tppabs="http://hissa.nist.gov/dads/HTML/asymplowrbnd.html"><em>asymptotic lower bound</em></a> [<strong>D</strong>]
<dt><a href="asymptotcspc.html" tppabs="http://hissa.nist.gov/dads/HTML/asymptotcspc.html"><em>asymptotic space complexity</em></a> [<strong>D</strong>]
<dt><a href="asymptotictm.html" tppabs="http://hissa.nist.gov/dads/HTML/asymptotictm.html"><em>asymptotic time complexity</em></a> [<strong>D</strong>]
<dt><a href="asympupprbnd.html" tppabs="http://hissa.nist.gov/dads/HTML/asympupprbnd.html"><em>asymptotic upper bound</em></a> [<strong>D</strong>]
<dt><a href="augmentngpth.html" tppabs="http://hissa.nist.gov/dads/HTML/augmentngpth.html"><em>augmenting path</em></a> [<strong>D</strong>]
<dt><a href="automaton.html" tppabs="http://hissa.nist.gov/dads/HTML/automaton.html"><em>automaton</em></a> [<strong>D</strong>]
<dt><a href="automatonsim.html" tppabs="http://hissa.nist.gov/dads/HTML/automatonsim.html"><em>automaton simulation</em></a> [<strong>D</strong>]
<dt><a href="averagecase.html" tppabs="http://hissa.nist.gov/dads/HTML/averagecase.html"><em>average-case</em></a> [<strong>D</strong>]
<dt><a href="averagecscst.html" tppabs="http://hissa.nist.gov/dads/HTML/averagecscst.html"><em>average-case cost</em></a> [<strong>D</strong>]
<dt><a href="averagemnmm.html" tppabs="http://hissa.nist.gov/dads/HTML/averagemnmm.html"><em>average minimum accesses</em></a>
<dt><a href="avltree.html" tppabs="http://hissa.nist.gov/dads/HTML/avltree.html"><em>AVL tree</em></a> [<strong>S</strong>]
</dl>

<a name="B"><h2>B</h2>

<dl>
<dt><a href="backtrack.html" tppabs="http://hissa.nist.gov/dads/HTML/backtrack.html"><em>backtracking</em></a> [<strong>T</strong>]
<dt><a href="bag.html" tppabs="http://hissa.nist.gov/dads/HTML/bag.html"><em>bag</em></a> [<strong>D</strong>]
<dt><a href="balance.html" tppabs="http://hissa.nist.gov/dads/HTML/balance.html"><em>balance</em></a> [<strong>D</strong>]
<dt><a href="balancedbist.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedbist.html"><em>balanced binary search tree</em></a> [<strong>S</strong>]
<dt><a href="balancedbitr.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedbitr.html"><em>balanced binary tree</em></a> [<strong>S</strong>]
<dt><a href="balanckwayms.html" tppabs="http://hissa.nist.gov/dads/HTML/balanckwayms.html"><em>balanced k-way merge sort</em></a> [<strong>A</strong>]
<dt><a href="balancmrgsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/balancmrgsrt.html"><em>balanced merge sort</em></a> [<strong>A</strong>]
<dt><a href="balncdmltwym.html" tppabs="http://hissa.nist.gov/dads/HTML/balncdmltwym.html"><em>balanced multiway merge</em></a> [<strong>A</strong>]
<dt><a href="balancedmway.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedmway.html"><em>balanced multiway tree</em></a> [<strong>S</strong>]
<dt><a href="balancednod.html" tppabs="http://hissa.nist.gov/dads/HTML/balancednod.html"><em>balanced node</em></a>
<dt><a href="balancedqsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedqsrt.html"><em>balanced quicksort</em></a> [<strong>A</strong>]
<dt><a href="balancedtree.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedtree.html"><em>balanced tree</em></a> [<strong>D</strong>]
<dt><a href="balanc2wayms.html" tppabs="http://hissa.nist.gov/dads/HTML/balanc2wayms.html"><em>balanced two-way merge sort</em></a> [<strong>A</strong>]
<dt><a href="balancbyredu.html" tppabs="http://hissa.nist.gov/dads/HTML/balancbyredu.html"><em>balancing by internal path reduction</em></a>
<dt><a href="bangfile.html" tppabs="http://hissa.nist.gov/dads/HTML/bangfile.html"><em>BANG file</em></a> [<strong>S</strong>]
<dt><a href="bbalphatree.html" tppabs="http://hissa.nist.gov/dads/HTML/bbalphatree.html"><em>BB <img src="alpha.gif" tppabs="http://hissa.nist.gov/dads/Images/alpha.gif"  border=0 height=7  width=8  alt="alpha"> tree</em></a> [<strong>D</strong>]
<dt><a href="bdtree.html" tppabs="http://hissa.nist.gov/dads/HTML/bdtree.html"><em>BD-tree</em></a> [<strong>S</strong>]
<dt><a href="bellmanford.html" tppabs="http://hissa.nist.gov/dads/HTML/bellmanford.html"><em>Bellman-Ford algorithm</em></a> [<strong>A</strong>]
<dt><a href="benfordslaw.html" tppabs="http://hissa.nist.gov/dads/HTML/benfordslaw.html"><em>Benford's law</em></a> [<strong>D</strong>]
<dt><a href="bestcase.html" tppabs="http://hissa.nist.gov/dads/HTML/bestcase.html"><em>best-case</em></a> [<strong>D</strong>]
<dt><a href="bestcasecost.html" tppabs="http://hissa.nist.gov/dads/HTML/bestcasecost.html"><em>best-case cost</em></a> [<strong>D</strong>]
<dt><a href="bestfirst.html" tppabs="http://hissa.nist.gov/dads/HTML/bestfirst.html"><em>best first search</em></a> [<strong>A</strong>]
<dt><a href="bicnnctdcmpn.html" tppabs="http://hissa.nist.gov/dads/HTML/bicnnctdcmpn.html"><em>biconnected component</em></a> [<strong>D</strong>]
<dt><a href="bicnnctdgrph.html" tppabs="http://hissa.nist.gov/dads/HTML/bicnnctdgrph.html"><em>biconnected graph</em></a> [<strong>D</strong>]
<dt><a href="bigOnotation.html" tppabs="http://hissa.nist.gov/dads/HTML/bigOnotation.html"><em>big-O notation</em></a> [<strong>D</strong>]
<dt><a href="binaryfunc.html" tppabs="http://hissa.nist.gov/dads/HTML/binaryfunc.html"><em>binary function</em></a> [<strong>D</strong>]
<dt><a href="binaryheap.html" tppabs="http://hissa.nist.gov/dads/HTML/binaryheap.html"><em>binary heap</em></a> [<strong>S</strong>]
<dt><a href="binaryinsort.html" tppabs="http://hissa.nist.gov/dads/HTML/binaryinsort.html"><em>binary insertion sort</em></a> [<strong>A</strong>]
<dt><a href="binarypriorq.html" tppabs="http://hissa.nist.gov/dads/HTML/binarypriorq.html"><em>binary priority queue</em></a> [<strong>S</strong>]
<dt><a href="binaryrelatn.html" tppabs="http://hissa.nist.gov/dads/HTML/binaryrelatn.html"><em>binary relation</em></a> [<strong>D</strong>]
<dt><a href="binarysrch.html" tppabs="http://hissa.nist.gov/dads/HTML/binarysrch.html"><em>binary search</em></a> [<strong>A</strong>]
<dt><a href="binarysrchtr.html" tppabs="http://hissa.nist.gov/dads/HTML/binarysrchtr.html"><em>binary search tree</em></a> [<strong>S</strong>]
<dt><a href="binarytree.html" tppabs="http://hissa.nist.gov/dads/HTML/binarytree.html"><em>binary tree</em></a> [<strong>D</strong>]
<dt><a href="binrytrrprsn.html" tppabs="http://hissa.nist.gov/dads/HTML/binrytrrprsn.html"><em>binary tree representation of trees</em></a>
<dt><a href="binarytrie.html" tppabs="http://hissa.nist.gov/dads/HTML/binarytrie.html"><em>binary trie</em></a>
<dt><a href="bingosort.html" tppabs="http://hissa.nist.gov/dads/HTML/bingosort.html"><em>bingo sort</em></a> [<strong>A</strong>]
<dt><a href="binomialheap.html" tppabs="http://hissa.nist.gov/dads/HTML/binomialheap.html"><em>binomial heap</em></a> [<strong>S</strong>]
<dt><a href="binomialque.html" tppabs="http://hissa.nist.gov/dads/HTML/binomialque.html"><em>binomial queue</em></a> [<strong>S</strong>]
<dt><a href="binomialtree.html" tppabs="http://hissa.nist.gov/dads/HTML/binomialtree.html"><em>binomial tree</em></a> [<strong>S</strong>]
<dt><a href="binpacking.html" tppabs="http://hissa.nist.gov/dads/HTML/binpacking.html"><em>bin packing</em></a> [<strong>P</strong>]
<dt><a href="binsort.html" tppabs="http://hissa.nist.gov/dads/HTML/binsort.html"><em>bin sort</em></a> [<strong>A</strong>]
<dt><a href="bintree.html" tppabs="http://hissa.nist.gov/dads/HTML/bintree.html"><em>bintree</em></a> [<strong>S</strong>]
<dt><a href="bipartgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/bipartgraph.html"><em>bipartite graph</em></a> [<strong>D</strong>]
<dt><a href="bipartmatch.html" tppabs="http://hissa.nist.gov/dads/HTML/bipartmatch.html"><em>bipartite matching</em></a> [<strong>D</strong>]
<dt><a href="bipartition.html" tppabs="http://hissa.nist.gov/dads/HTML/bipartition.html"><em>bipartition search</em></a>
<dt><a href="bisection.html" tppabs="http://hissa.nist.gov/dads/HTML/bisection.html"><em>bisection search</em></a>
<dt><a href="bisector.html" tppabs="http://hissa.nist.gov/dads/HTML/bisector.html"><em>bisector</em></a> [<strong>D</strong>]
<dt><a href="bisimulequiv.html" tppabs="http://hissa.nist.gov/dads/HTML/bisimulequiv.html"><em>bisimulation equivalence</em></a> [<strong>D</strong>]
<dt><a href="bitonictour.html" tppabs="http://hissa.nist.gov/dads/HTML/bitonictour.html"><em>bitonic tour</em></a>
<dt><a href="bktree.html" tppabs="http://hissa.nist.gov/dads/HTML/bktree.html"><em>B<sub>k</sub> tree</em></a> [<strong>S</strong>]
<dt><a href="block.html" tppabs="http://hissa.nist.gov/dads/HTML/block.html"><em>block</em></a> [<strong>D</strong>]
<dt><a href="blockingflow.html" tppabs="http://hissa.nist.gov/dads/HTML/blockingflow.html"><em>blocking flow</em></a> [<strong>D</strong>]
<dt><a href="bloomfilt.html" tppabs="http://hissa.nist.gov/dads/HTML/bloomfilt.html"><em>Bloom filter</em></a> [<strong>A</strong>]
<dt><a href="blossom.html" tppabs="http://hissa.nist.gov/dads/HTML/blossom.html"><em>blossom</em></a> [<strong>D</strong>]
<dt><a href="booleanexpr.html" tppabs="http://hissa.nist.gov/dads/HTML/booleanexpr.html"><em>boolean expression</em></a> [<strong>D</strong>]
<dt><a href="booleanfnctn.html" tppabs="http://hissa.nist.gov/dads/HTML/booleanfnctn.html"><em>boolean function</em></a> [<strong>D</strong>]
<dt><a href="border.html" tppabs="http://hissa.nist.gov/dads/HTML/border.html"><em>border</em></a> [<strong>D</strong>]
<dt><a href="btltravsale.html" tppabs="http://hissa.nist.gov/dads/HTML/btltravsale.html"><em>bottleneck traveling salesman</em></a> [<strong>P</strong>]
<dt><a href="bottomuprdx.html" tppabs="http://hissa.nist.gov/dads/HTML/bottomuprdx.html"><em>bottom-up radix sort</em></a> [<strong>A</strong>]
<dt><a href="bottmptrtmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/bottmptrtmtn.html"><em>bottom-up tree automaton</em></a> [<strong>D</strong>]
<dt><a href="boundarybasd.html" tppabs="http://hissa.nist.gov/dads/HTML/boundarybasd.html"><em>boundary-based representation</em></a> [<strong>D</strong>]
<dt><a href="boundedblnc.html" tppabs="http://hissa.nist.gov/dads/HTML/boundedblnc.html"><em>bounded balance tree</em></a>