index.htm

数据结构词典（英文）

<dt><a href="bounded.html" tppabs="http://hissa.nist.gov/dads/HTML/bounded.html"><em>bounded disorder</em></a>
<dt><a href="boundedqueue.html" tppabs="http://hissa.nist.gov/dads/HTML/boundedqueue.html"><em>bounded queue</em></a> [<strong>S</strong>]
<dt><a href="boundedstack.html" tppabs="http://hissa.nist.gov/dads/HTML/boundedstack.html"><em>bounded stack</em></a> [<strong>S</strong>]
<dt><a href="boyermoore.html" tppabs="http://hissa.nist.gov/dads/HTML/boyermoore.html"><em>Boyer-Moore</em></a> [<strong>A</strong>]
<dt><a href="boyermoorhor.html" tppabs="http://hissa.nist.gov/dads/HTML/boyermoorhor.html"><em>Boyer-Moore-Horspool</em></a> [<strong>A</strong>]
<dt><a href="bplustree.html" tppabs="http://hissa.nist.gov/dads/HTML/bplustree.html"><em>B+-tree</em></a> [<strong>S</strong>]
<dt><a href="bradfordslw.html" tppabs="http://hissa.nist.gov/dads/HTML/bradfordslw.html"><em>Bradford's law</em></a>
<dt><a href="branchNbound.html" tppabs="http://hissa.nist.gov/dads/HTML/branchNbound.html"><em>branch and bound</em></a> [<strong>A</strong>]
<dt><a href="branching.html" tppabs="http://hissa.nist.gov/dads/HTML/branching.html"><em>branching</em></a> [<strong>D</strong>]
<dt><a href="breadthfirst.html" tppabs="http://hissa.nist.gov/dads/HTML/breadthfirst.html"><em>breadth first search</em></a> [<strong>A</strong>]
<dt><a href="brentsalamn.html" tppabs="http://hissa.nist.gov/dads/HTML/brentsalamn.html"><em>Brent-Salamin</em></a>
<dt><a href="brent.html" tppabs="http://hissa.nist.gov/dads/HTML/brent.html"><em>Brent's algorithm</em></a>
<dt><a href="brentshash.html" tppabs="http://hissa.nist.gov/dads/HTML/brentshash.html"><em>Brent's hashing</em></a>
<dt><a href="bridge.html" tppabs="http://hissa.nist.gov/dads/HTML/bridge.html"><em>bridge</em></a> [<strong>D</strong>]
<dt><a href="britishmusm.html" tppabs="http://hissa.nist.gov/dads/HTML/britishmusm.html"><em>British Museum algorithm</em></a> [<strong>T</strong>]
<dt><a href="bruteforce.html" tppabs="http://hissa.nist.gov/dads/HTML/bruteforce.html"><em>brute force</em></a> [<strong>T</strong>]
<dt><a href="bruteforcess.html" tppabs="http://hissa.nist.gov/dads/HTML/bruteforcess.html"><em>brute force string search</em></a> [<strong>A</strong>]
<dt><a href="brutefrmismt.html" tppabs="http://hissa.nist.gov/dads/HTML/brutefrmismt.html"><em>brute force string search with mismatches</em></a> [<strong>A</strong>]
<dt><a href="bspline.html" tppabs="http://hissa.nist.gov/dads/HTML/bspline.html"><em>B-spline</em></a> [<strong>A</strong>]
<dt><a href="bsptree.html" tppabs="http://hissa.nist.gov/dads/HTML/bsptree.html"><em>BSP-tree</em></a> [<strong>S</strong>]
<dt><a href="bstartree.html" tppabs="http://hissa.nist.gov/dads/HTML/bstartree.html"><em>B*-tree</em></a> [<strong>S</strong>]
<dt><a href="btree.html" tppabs="http://hissa.nist.gov/dads/HTML/btree.html"><em>B-tree</em></a> [<strong>S</strong>]
<dt><a href="bubblesort.html" tppabs="http://hissa.nist.gov/dads/HTML/bubblesort.html"><em>bubble sort</em></a> [<strong>A</strong>]
<dt><a href="bucket.html" tppabs="http://hissa.nist.gov/dads/HTML/bucket.html"><em>bucket</em></a> [<strong>D</strong>]
<dt><a href="bucketarray.html" tppabs="http://hissa.nist.gov/dads/HTML/bucketarray.html"><em>bucket array</em></a> [<strong>S</strong>]
<dt><a href="bucketbinry.html" tppabs="http://hissa.nist.gov/dads/HTML/bucketbinry.html"><em>bucket binary trie</em></a>
<dt><a href="bucketmeth.html" tppabs="http://hissa.nist.gov/dads/HTML/bucketmeth.html"><em>bucketing method</em></a> [<strong>D</strong>]
<dt><a href="bucketsort.html" tppabs="http://hissa.nist.gov/dads/HTML/bucketsort.html"><em>bucket sort</em></a> [<strong>A</strong>]
<dt><a href="buckettrie.html" tppabs="http://hissa.nist.gov/dads/HTML/buckettrie.html"><em>bucket trie</em></a>
<dt><a href="buddysystem.html" tppabs="http://hissa.nist.gov/dads/HTML/buddysystem.html"><em>buddy system</em></a> [<strong>A</strong>]
<dt><a href="buddytree.html" tppabs="http://hissa.nist.gov/dads/HTML/buddytree.html"><em>buddy tree</em></a> [<strong>S</strong>]
<dt><a href="bvtree.html" tppabs="http://hissa.nist.gov/dads/HTML/bvtree.html"><em>BV-tree</em></a> [<strong>S</strong>]
<dt><a href="byzantine.html" tppabs="http://hissa.nist.gov/dads/HTML/byzantine.html"><em>Byzantine generals</em></a> [<strong>P</strong>]
</dl>

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

<dl>
<dt><a href="calculated.html" tppabs="http://hissa.nist.gov/dads/HTML/calculated.html"><em>calculated entry search</em></a>
<dt><a href="calcucommsys.html" tppabs="http://hissa.nist.gov/dads/HTML/calcucommsys.html"><em>Calculus of Communicating Systems</em></a> [<strong>D</strong>]
<dt><a href="calendarque.html" tppabs="http://hissa.nist.gov/dads/HTML/calendarque.html"><em>calendar queue</em></a> [<strong>S</strong>]
<dt><a href="candidate.html" tppabs="http://hissa.nist.gov/dads/HTML/candidate.html"><em>candidate consistency testing</em></a> [<strong>D</strong>]
<dt><a href="candidate3.html" tppabs="http://hissa.nist.gov/dads/HTML/candidate3.html"><em>candidate verification</em></a> [<strong>D</strong>]
<dt><a href="canonical.html" tppabs="http://hissa.nist.gov/dads/HTML/canonical.html"><em>canonical complexity class</em></a> [<strong>D</strong>]
<dt><a href="capacifacloc.html" tppabs="http://hissa.nist.gov/dads/HTML/capacifacloc.html"><em>capacitated facility location</em></a> [<strong>P</strong>]
<dt><a href="capacity.html" tppabs="http://hissa.nist.gov/dads/HTML/capacity.html"><em>capacity</em></a> [<strong>D</strong>]
<dt><a href="capacitycstr.html" tppabs="http://hissa.nist.gov/dads/HTML/capacitycstr.html"><em>capacity constraint</em></a> [<strong>D</strong>]
<dt><a href="cascademerg.html" tppabs="http://hissa.nist.gov/dads/HTML/cascademerg.html"><em>cascade merge sort</em></a>
<dt><a href="cayleypurser.html" tppabs="http://hissa.nist.gov/dads/HTML/cayleypurser.html"><em>Cayley-Purser</em></a> [<strong>A</strong>]
<dt><a href="cbt.html" tppabs="http://hissa.nist.gov/dads/HTML/cbt.html"><em>CBT</em></a> [<strong>D</strong>]
<dt><a href="ccs.html" tppabs="http://hissa.nist.gov/dads/HTML/ccs.html"><em>CCS</em></a> [<strong>D</strong>]
<dt><a href="ccurve.html" tppabs="http://hissa.nist.gov/dads/HTML/ccurve.html"><em>C curve</em></a>
<dt><a href="cellarhash.html" tppabs="http://hissa.nist.gov/dads/HTML/cellarhash.html"><em>cellar hashing</em></a>
<dt><a href="cellprobemdl.html" tppabs="http://hissa.nist.gov/dads/HTML/cellprobemdl.html"><em>cell probe model</em></a> [<strong>D</strong>]
<dt><a href="celltree.html" tppabs="http://hissa.nist.gov/dads/HTML/celltree.html"><em>cell tree</em></a> [<strong>S</strong>]
<dt><a href="cellulartmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/cellulartmtn.html"><em>cellular automaton</em></a> [<strong>D</strong>]
<dt><a href="centered.html" tppabs="http://hissa.nist.gov/dads/HTML/centered.html"><em>centered search</em></a>
<dt><a href="centroid.html" tppabs="http://hissa.nist.gov/dads/HTML/centroid.html"><em>centroid</em></a> [<strong>D</strong>]
<dt><a href="certificate.html" tppabs="http://hissa.nist.gov/dads/HTML/certificate.html"><em>certificate</em></a> [<strong>D</strong>]
<dt><a href="chain.html" tppabs="http://hissa.nist.gov/dads/HTML/chain.html"><em>chain</em></a> [<strong>D</strong>]
<dt><a href="chaining.html" tppabs="http://hissa.nist.gov/dads/HTML/chaining.html"><em>chaining</em></a> [<strong>S</strong>]
<dt><a href="child.html" tppabs="http://hissa.nist.gov/dads/HTML/child.html"><em>child</em></a> [<strong>D</strong>]
<dt><a href="chinesePstmn.html" tppabs="http://hissa.nist.gov/dads/HTML/chinesePstmn.html"><em>Chinese postman problem</em></a> [<strong>P</strong>]
<dt><a href="chineseRmndr.html" tppabs="http://hissa.nist.gov/dads/HTML/chineseRmndr.html"><em>Chinese remainder theorem</em></a> [<strong>A</strong>]
<dt><a href="chromaticndx.html" tppabs="http://hissa.nist.gov/dads/HTML/chromaticndx.html"><em>chromatic index</em></a> [<strong>D</strong>]
<dt><a href="chromatcnmbr.html" tppabs="http://hissa.nist.gov/dads/HTML/chromatcnmbr.html"><em>chromatic number</em></a> [<strong>D</strong>]
<dt><a href="circuit.html" tppabs="http://hissa.nist.gov/dads/HTML/circuit.html"><em>circuit</em></a> [<strong>D</strong>]
<dt><a href="circuit1.html" tppabs="http://hissa.nist.gov/dads/HTML/circuit1.html"><em>circuit complexity</em></a> [<strong>D</strong>]
<dt><a href="circuitvalue.html" tppabs="http://hissa.nist.gov/dads/HTML/circuitvalue.html"><em>circuit value problem</em></a> [<strong>D</strong>]
<dt><a href="circularlist.html" tppabs="http://hissa.nist.gov/dads/HTML/circularlist.html"><em>circular list</em></a>
<dt><a href="circularpth.html" tppabs="http://hissa.nist.gov/dads/HTML/circularpth.html"><em>circular path</em></a>
<dt><a href="clique.html" tppabs="http://hissa.nist.gov/dads/HTML/clique.html"><em>clique</em></a> [<strong>D</strong>]
<dt><a href="cliqueproblm.html" tppabs="http://hissa.nist.gov/dads/HTML/cliqueproblm.html"><em>clique problem</em></a> [<strong>P</strong>]
<dt><a href="clustering.html" tppabs="http://hissa.nist.gov/dads/HTML/clustering.html"><em>clustering</em></a> [<strong>D</strong>]
<dt><a href="clusterngfr.html" tppabs="http://hissa.nist.gov/dads/HTML/clusterngfr.html"><em>clustering free</em></a>
<dt><a href="coalescdhash.html" tppabs="http://hissa.nist.gov/dads/HTML/coalescdhash.html"><em>coalesced hashing</em></a> [<strong>S</strong>]
<dt><a href="coalescdhsh.html" tppabs="http://hissa.nist.gov/dads/HTML/coalescdhsh.html"><em>coalesced hashing with cellar</em></a>
<dt><a href="coalesc.html" tppabs="http://hissa.nist.gov/dads/HTML/coalesc.html"><em>coalescing chain</em></a>
<dt><a href="coarsening.html" tppabs="http://hissa.nist.gov/dads/HTML/coarsening.html"><em>coarsening</em></a> [<strong>D</strong>]
<dt><a href="cocktail.html" tppabs="http://hissa.nist.gov/dads/HTML/cocktail.html"><em>cocktail shaker sort</em></a>
<dt><a href="codeword.html" tppabs="http://hissa.nist.gov/dads/HTML/codeword.html"><em>codeword</em></a> [<strong>D</strong>]
<dt><a href="collectrecur.html" tppabs="http://hissa.nist.gov/dads/HTML/collectrecur.html"><em>collective recursion</em></a> [<strong>T</strong>]
<dt><a href="collision.html" tppabs="http://hissa.nist.gov/dads/HTML/collision.html"><em>collision</em></a> [<strong>D</strong>]
<dt><a href="collisionres.html" tppabs="http://hissa.nist.gov/dads/HTML/collisionres.html"><em>collision resolution scheme</em></a> [<strong>A</strong>]
<dt><a href="colussi.html" tppabs="http://hissa.nist.gov/dads/HTML/colussi.html"><em>Colussi</em></a> [<strong>A</strong>]
<dt><a href="combsort.html" tppabs="http://hissa.nist.gov/dads/HTML/combsort.html"><em>comb sort</em></a> [<strong>A</strong>]
<dt><a href="communseqpro.html" tppabs="http://hissa.nist.gov/dads/HTML/communseqpro.html"><em>Communicating Sequential Processes</em></a> [<strong>D</strong>]
<dt><a href="commutative.html" tppabs="http://hissa.nist.gov/dads/HTML/commutative.html"><em>commutative</em></a> [<strong>D</strong>]
<dt><a href="comparisnsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/comparisnsrt.html"><em>comparison sort</em></a> [<strong>D</strong>]
<dt><a href="competitive.html" tppabs="http://hissa.nist.gov/dads/HTML/competitive.html"><em>competitive analysis</em></a> [<strong>D</strong>]
<dt><a href="competitivrt.html" tppabs="http://hissa.nist.gov/dads/HTML/competitivrt.html"><em>competitive ratio</em></a> [<strong>D</strong>]
<dt><a href="completbintr.html" tppabs="http://hissa.nist.gov/dads/HTML/completbintr.html"><em>complete binary tree</em></a> [<strong>D</strong>]
<dt><a href="completgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/completgraph.html"><em>complete graph</em></a> [<strong>D</strong>]
<dt><a href="completkrytr.html" tppabs="http://hissa.nist.gov/dads/HTML/completkrytr.html"><em>complete <em>k</em>-ary tree</em></a>
<dt><a href="completetree.html" tppabs="http://hissa.nist.gov/dads/HTML/completetree.html"><em>complete tree</em></a> [<strong>D</strong>]
<dt><a href="complexity.html" tppabs="http://hissa.nist.gov/dads/HTML/complexity.html"><em>complexity</em></a> [<strong>D</strong>]
<dt><a href="complexitycl.html" tppabs="http://hissa.nist.gov/dads/HTML/complexitycl.html"><em>complexity class</em></a> [<strong>D</strong>]
<dt><a href="complexityNP.html" tppabs="http://hissa.nist.gov/dads/HTML/complexityNP.html"><em>complexity class NP</em></a> [<strong>D</strong>]
<dt><a href="complexityP.html" tppabs="http://hissa.nist.gov/dads/HTML/complexityP.html"><em>complexity class P</em></a> [<strong>D</strong>]
<dt><a href="complexityPS.html" tppabs="http://hissa.nist.gov/dads/HTML/complexityPS.html"><em>complexity class PSPACE</em></a> [<strong>D</strong>]
<dt><a href="compressdtr.html" tppabs="http://hissa.nist.gov/dads/HTML/compressdtr.html"><em>compressed trie</em></a>
<dt><a href="computable.html" tppabs="http://hissa.nist.gov/dads/HTML/computable.html"><em>computable</em></a> [<strong>D</strong>]
<dt><a href="computable1.html" tppabs="http://hissa.nist.gov/dads/HTML/computable1.html"><em>computable function</em></a> [<strong>D</strong>]
<dt><a href="concavefunct.html" tppabs="http://hissa.nist.gov/dads/HTML/concavefunct.html"><em>concave function</em></a> [<strong>D</strong>]
<dt><a href="concurrntflw.html" tppabs="http://hissa.nist.gov/dads/HTML/concurrntflw.html"><em>concurrent flow</em></a> [<strong>D</strong>]
<dt><a href="concrrntrdcn.html" tppabs="http://hissa.nist.gov/dads/HTML/concrrntrdcn.html"><em>concurrent read, concurrent write</em></a> [<strong>D</strong>]
<dt><a href="concrrntrdxc.html" tppabs="http://hissa.nist.gov/dads/HTML/concrrntrdxc.html"><em>concurrent read, exclusive write</em></a> [<strong>D</strong>]
<dt><a href="configuratin.html" tppabs="http://hissa.nist.gov/dads/HTML/configuratin.html"><em>configuration</em></a> [<strong>D</strong>]
<dt><a href="conjunction.html" tppabs="http://hissa.nist.gov/dads/HTML/conjunction.html"><em>conjunction</em></a> [<strong>D</strong>]
<dt><a href="connctdcmpnn.html" tppabs="http://hissa.nist.gov/dads/HTML/connctdcmpnn.html"><em>connected components</em></a> [<strong>A</strong>]
<dt><a href="connectdgraf.html" tppabs="http://hissa.nist.gov/dads/HTML/connectdgraf.html"><em>connected graph</em></a> [<strong>D</strong>]
<dt><a href="constantfunc.html" tppabs="http://hissa.nist.gov/dads/HTML/constantfunc.html"><em>constant function</em></a> [<strong>D</strong>]
<dt><a href="container.html" tppabs="http://hissa.nist.gov/dads/HTML/container.html"><em>container</em></a> [<strong>S</strong>]
<dt><a href="contaminatn.html" tppabs="http://hissa.nist.gov/dads/HTML/contaminatn.html"><em>contamination hashing</em></a>
<dt><a href="cookreductin.html" tppabs="http://hissa.nist.gov/dads/HTML/cookreductin.html"><em>Cook reduction</em></a> [<strong>D</strong>]
<dt><a href="cookstheorem.html" tppabs="http://hissa.nist.gov/dads/HTML/cookstheorem.html"><em>Cook's theorem</em></a> [<strong>D</strong>]
<dt><a href="countingsort.html" tppabs="http://hissa.nist.gov/dads/HTML/countingsort.html"><em>counting sort</em></a> [<strong>A</strong>]
<dt><a href="covering.html" tppabs="http://hissa.nist.gov/dads/HTML/covering.html"><em>covering</em></a> [<strong>D</strong>]