index.htm

数据结构词典（英文）

<dt><a href="crc.html" tppabs="http://hissa.nist.gov/dads/HTML/crc.html"><em>CRC</em></a> [<strong>A</strong>]
<dt><a href="crcw.html" tppabs="http://hissa.nist.gov/dads/HTML/crcw.html"><em>CRCW</em></a> [<strong>D</strong>]
<dt><a href="crew.html" tppabs="http://hissa.nist.gov/dads/HTML/crew.html"><em>CREW</em></a> [<strong>D</strong>]
<dt><a href="criticalPath.html" tppabs="http://hissa.nist.gov/dads/HTML/criticalPath.html"><em>critical path problem</em></a> [<strong>P</strong>]
<dt><a href="csp.html" tppabs="http://hissa.nist.gov/dads/HTML/csp.html"><em>CSP</em></a> [<strong>D</strong>]
<dt><a href="ctl.html" tppabs="http://hissa.nist.gov/dads/HTML/ctl.html"><em>CTL</em></a> [<strong>D</strong>]
<dt><a href="cut.html" tppabs="http://hissa.nist.gov/dads/HTML/cut.html"><em>cut</em></a> [<strong>D</strong>]
<dt><a href="cuttingplane.html" tppabs="http://hissa.nist.gov/dads/HTML/cuttingplane.html"><em>cutting plane</em></a> [<strong>D</strong>]
<dt><a href="cuttingtherm.html" tppabs="http://hissa.nist.gov/dads/HTML/cuttingtherm.html"><em>cutting theorem</em></a> [<strong>D</strong>]
<dt><a href="cutvertex.html" tppabs="http://hissa.nist.gov/dads/HTML/cutvertex.html"><em>cut vertex</em></a> [<strong>D</strong>]
<dt><a href="cycle.html" tppabs="http://hissa.nist.gov/dads/HTML/cycle.html"><em>cycle</em></a> [<strong>D</strong>]
<dt><a href="cyclicredncy.html" tppabs="http://hissa.nist.gov/dads/HTML/cyclicredncy.html"><em>cyclic redundancy check</em></a> [<strong>A</strong>]
<dt><a href="cyclic.html" tppabs="http://hissa.nist.gov/dads/HTML/cyclic.html"><em>cyclic structure</em></a>
</dl>

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

<dl>
<dt><a href="dadjacent.html" tppabs="http://hissa.nist.gov/dads/HTML/dadjacent.html"><em>D-adjacent</em></a> [<strong>D</strong>]
<dt><a href="dag.html" tppabs="http://hissa.nist.gov/dads/HTML/dag.html"><em>DAG</em></a> [<strong>D</strong>]
<dt><a href="dagShortPath.html" tppabs="http://hissa.nist.gov/dads/HTML/dagShortPath.html"><em>DAG shortest paths</em></a> [<strong>A</strong>]
<dt><a href="dasg.html" tppabs="http://hissa.nist.gov/dads/HTML/dasg.html"><em>DASG</em></a>
<dt><a href="datastructur.html" tppabs="http://hissa.nist.gov/dads/HTML/datastructur.html"><em>data structure</em></a> [<strong>S</strong>]
<dt><a href="dawg.html" tppabs="http://hissa.nist.gov/dads/HTML/dawg.html"><em>DAWG</em></a>
<dt><a href="decidable.html" tppabs="http://hissa.nist.gov/dads/HTML/decidable.html"><em>decidable</em></a>
<dt><a href="decidabllngg.html" tppabs="http://hissa.nist.gov/dads/HTML/decidabllngg.html"><em>decidable language</em></a> [<strong>D</strong>]
<dt><a href="decidable1.html" tppabs="http://hissa.nist.gov/dads/HTML/decidable1.html"><em>decidable problem</em></a> [<strong>D</strong>]
<dt><a href="decimation.html" tppabs="http://hissa.nist.gov/dads/HTML/decimation.html"><em>decimation</em></a> [<strong>T</strong>]
<dt><a href="decisionpblm.html" tppabs="http://hissa.nist.gov/dads/HTML/decisionpblm.html"><em>decision problem</em></a> [<strong>D</strong>]
<dt><a href="decisiontree.html" tppabs="http://hissa.nist.gov/dads/HTML/decisiontree.html"><em>decision tree</em></a>
<dt><a href="decomposable.html" tppabs="http://hissa.nist.gov/dads/HTML/decomposable.html"><em>decomposable searching problem</em></a> [<strong>D</strong>]
<dt><a href="degree.html" tppabs="http://hissa.nist.gov/dads/HTML/degree.html"><em>degree</em></a> [<strong>D</strong>]
<dt><a href="degreekgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/degreekgraph.html"><em>degree-<em>k</em> graph</em></a>
<dt><a href="delete.html" tppabs="http://hissa.nist.gov/dads/HTML/delete.html"><em>delete</em></a> [<strong>A</strong>]
<dt><a href="densegraph.html" tppabs="http://hissa.nist.gov/dads/HTML/densegraph.html"><em>dense graph</em></a> [<strong>D</strong>]
<dt><a href="depoissonztn.html" tppabs="http://hissa.nist.gov/dads/HTML/depoissonztn.html"><em>depoissonization</em></a> [<strong>D</strong>]
<dt><a href="depth.html" tppabs="http://hissa.nist.gov/dads/HTML/depth.html"><em>depth</em></a> [<strong>D</strong>]
<dt><a href="depthfirst.html" tppabs="http://hissa.nist.gov/dads/HTML/depthfirst.html"><em>depth first search</em></a> [<strong>A</strong>]
<dt><a href="depthnode.html" tppabs="http://hissa.nist.gov/dads/HTML/depthnode.html"><em>depth node</em></a>
<dt><a href="depthtrie.html" tppabs="http://hissa.nist.gov/dads/HTML/depthtrie.html"><em>depth trie</em></a>
<dt><a href="deque.html" tppabs="http://hissa.nist.gov/dads/HTML/deque.html"><em>deque</em></a> [<strong>S</strong>]
<dt><a href="descendant.html" tppabs="http://hissa.nist.gov/dads/HTML/descendant.html"><em>descendant</em></a> [<strong>D</strong>]
<dt><a href="deterministc.html" tppabs="http://hissa.nist.gov/dads/HTML/deterministc.html"><em>deterministic</em></a> [<strong>D</strong>]
<dt><a href="determinalgo.html" tppabs="http://hissa.nist.gov/dads/HTML/determinalgo.html"><em>deterministic algorithm</em></a> [<strong>T</strong>]
<dt><a href="determfnatss.html" tppabs="http://hissa.nist.gov/dads/HTML/determfnatss.html"><em>deterministic finite automata string search</em></a> [<strong>A</strong>]
<dt><a href="determfinaut.html" tppabs="http://hissa.nist.gov/dads/HTML/determfinaut.html"><em>deterministic finite automaton</em></a> [<strong>D</strong>]
<dt><a href="detrmfinstau.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfinstau.html"><em>deterministic finite state automaton</em></a> [<strong>D</strong>]
<dt><a href="detrmfinstmc.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfinstmc.html"><em>deterministic finite state machine</em></a> [<strong>D</strong>]
<dt><a href="detrmfintrau.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmfintrau.html"><em>deterministic finite tree automaton</em></a> [<strong>D</strong>]
<dt><a href="determpushda.html" tppabs="http://hissa.nist.gov/dads/HTML/determpushda.html"><em>deterministic pushdown automaton</em></a> [<strong>D</strong>]
<dt><a href="detrmtreeaut.html" tppabs="http://hissa.nist.gov/dads/HTML/detrmtreeaut.html"><em>deterministic tree automaton</em></a> [<strong>D</strong>]
<dt><a href="dfa.html" tppabs="http://hissa.nist.gov/dads/HTML/dfa.html"><em>DFA</em></a> [<strong>D</strong>]
<dt><a href="dFSforest.html" tppabs="http://hissa.nist.gov/dads/HTML/dFSforest.html"><em>DFS forest</em></a> [<strong>D</strong>]
<dt><a href="dfta.html" tppabs="http://hissa.nist.gov/dads/HTML/dfta.html"><em>DFTA</em></a> [<strong>D</strong>]
<dt><a href="diagonaliztn.html" tppabs="http://hissa.nist.gov/dads/HTML/diagonaliztn.html"><em>diagonalization</em></a> [<strong>D</strong>]
<dt><a href="diameter.html" tppabs="http://hissa.nist.gov/dads/HTML/diameter.html"><em>diameter</em></a> [<strong>D</strong>]
<dt><a href="dichotomic.html" tppabs="http://hissa.nist.gov/dads/HTML/dichotomic.html"><em>dichotomic search</em></a> [<strong>D</strong>]
<dt><a href="dictionary.html" tppabs="http://hissa.nist.gov/dads/HTML/dictionary.html"><em>dictionary</em></a> [<strong>S</strong>]
<dt><a href="diet.html" tppabs="http://hissa.nist.gov/dads/HTML/diet.html"><em>diet</em></a> [<strong>S</strong>]
<dt><a href="difference.html" tppabs="http://hissa.nist.gov/dads/HTML/difference.html"><em>difference</em></a> [<strong>D</strong>]
<dt><a href="digitalbtre.html" tppabs="http://hissa.nist.gov/dads/HTML/digitalbtre.html"><em>digital B-tree</em></a>
<dt><a href="digital.html" tppabs="http://hissa.nist.gov/dads/HTML/digital.html"><em>digital decomposition</em></a>
<dt><a href="digitalindx.html" tppabs="http://hissa.nist.gov/dads/HTML/digitalindx.html"><em>digital indexing</em></a>
<dt><a href="digitalsrch.html" tppabs="http://hissa.nist.gov/dads/HTML/digitalsrch.html"><em>digital search tree</em></a>
<dt><a href="digitaltree.html" tppabs="http://hissa.nist.gov/dads/HTML/digitaltree.html"><em>digital tree</em></a> [<strong>S</strong>]
<dt><a href="digitaltrie.html" tppabs="http://hissa.nist.gov/dads/HTML/digitaltrie.html"><em>digital trie</em></a>
<dt><a href="digraph.html" tppabs="http://hissa.nist.gov/dads/HTML/digraph.html"><em>digraph</em></a> [<strong>S</strong>]
<dt><a href="dijkstraalgo.html" tppabs="http://hissa.nist.gov/dads/HTML/dijkstraalgo.html"><em>Dijkstra's algorithm</em></a> [<strong>A</strong>]
<dt><a href="diminish.html" tppabs="http://hissa.nist.gov/dads/HTML/diminish.html"><em>diminishing increment sort</em></a> [<strong>A</strong>]
<dt><a href="diningphilos.html" tppabs="http://hissa.nist.gov/dads/HTML/diningphilos.html"><em>dining philosophers</em></a> [<strong>P</strong>]
<dt><a href="directchhash.html" tppabs="http://hissa.nist.gov/dads/HTML/directchhash.html"><em>direct chaining hashing</em></a> [<strong>S</strong>]
<dt><a href="diracygraf.html" tppabs="http://hissa.nist.gov/dads/HTML/diracygraf.html"><em>directed acyclic graph</em></a> [<strong>D</strong>]
<dt><a href="directacycss.html" tppabs="http://hissa.nist.gov/dads/HTML/directacycss.html"><em>directed acyclic subsequence graph</em></a>
<dt><a href="directacycwd.html" tppabs="http://hissa.nist.gov/dads/HTML/directacycwd.html"><em>directed acyclic word graph</em></a>
<dt><a href="directgraph.html" tppabs="http://hissa.nist.gov/dads/HTML/directgraph.html"><em>directed graph</em></a> [<strong>S</strong>]
<dt><a href="discretintrv.html" tppabs="http://hissa.nist.gov/dads/HTML/discretintrv.html"><em>discrete interval encoding tree</em></a> [<strong>S</strong>]
<dt><a href="discretpcntr.html" tppabs="http://hissa.nist.gov/dads/HTML/discretpcntr.html"><em>discrete p-center</em></a> [<strong>P</strong>]
<dt><a href="disjointset.html" tppabs="http://hissa.nist.gov/dads/HTML/disjointset.html"><em>disjoint set</em></a> [<strong>D</strong>]
<dt><a href="disjntstdtst.html" tppabs="http://hissa.nist.gov/dads/HTML/disjntstdtst.html"><em>disjoint-set data structure</em></a>
<dt><a href="disjntstfrst.html" tppabs="http://hissa.nist.gov/dads/HTML/disjntstfrst.html"><em>disjoint-set forest</em></a>
<dt><a href="disjunction.html" tppabs="http://hissa.nist.gov/dads/HTML/disjunction.html"><em>disjunction</em></a> [<strong>D</strong>]
<dt><a href="distributinl.html" tppabs="http://hissa.nist.gov/dads/HTML/distributinl.html"><em>distributional complexity</em></a> [<strong>D</strong>]
<dt><a href="distribsort.html" tppabs="http://hissa.nist.gov/dads/HTML/distribsort.html"><em>distribution sort</em></a> [<strong>A</strong>]
<dt><a href="divideconqr.html" tppabs="http://hissa.nist.gov/dads/HTML/divideconqr.html"><em>divide and conquer</em></a> [<strong>T</strong>]
<dt><a href="dividemarrig.html" tppabs="http://hissa.nist.gov/dads/HTML/dividemarrig.html"><em>divide and marriage before conquest</em></a> [<strong>T</strong>]
<dt><a href="divisionmthd.html" tppabs="http://hissa.nist.gov/dads/HTML/divisionmthd.html"><em>division method</em></a>
<dt><a href="domain.html" tppabs="http://hissa.nist.gov/dads/HTML/domain.html"><em>domain</em></a> [<strong>D</strong>]
<dt><a href="dontcare.html" tppabs="http://hissa.nist.gov/dads/HTML/dontcare.html"><em>don't care</em></a> [<strong>D</strong>]
<dt><a href="doomsday.html" tppabs="http://hissa.nist.gov/dads/HTML/doomsday.html"><em>Doomsday rule</em></a> [<strong>A</strong>]
<dt><a href="doubledrctn.html" tppabs="http://hissa.nist.gov/dads/HTML/doubledrctn.html"><em>double-direction bubblesort</em></a>
<dt><a href="doubleendpq.html" tppabs="http://hissa.nist.gov/dads/HTML/doubleendpq.html"><em>double-ended priority queue</em></a> [<strong>S</strong>]
<dt><a href="doublehashng.html" tppabs="http://hissa.nist.gov/dads/HTML/doublehashng.html"><em>double hashing</em></a> [<strong>A</strong>]
<dt><a href="doubleleft.html" tppabs="http://hissa.nist.gov/dads/HTML/doubleleft.html"><em>double left rotation</em></a>
<dt><a href="doubleright.html" tppabs="http://hissa.nist.gov/dads/HTML/doubleright.html"><em>double right rotation</em></a>
<dt><a href="doublerottn.html" tppabs="http://hissa.nist.gov/dads/HTML/doublerottn.html"><em>double rotation</em></a>
<dt><a href="doublendque.html" tppabs="http://hissa.nist.gov/dads/HTML/doublendque.html"><em>doubly-ended queue</em></a> [<strong>S</strong>]
<dt><a href="dbllnklist.html" tppabs="http://hissa.nist.gov/dads/HTML/dbllnklist.html"><em>doubly linked list</em></a> [<strong>S</strong>]
<dt><a href="dpda.html" tppabs="http://hissa.nist.gov/dads/HTML/dpda.html"><em>DPDA</em></a> [<strong>D</strong>]
<dt><a href="dprefix.html" tppabs="http://hissa.nist.gov/dads/HTML/dprefix.html"><em>d-prefix</em></a>
<dt><a href="dragoncurve.html" tppabs="http://hissa.nist.gov/dads/HTML/dragoncurve.html"><em>Dragon curve</em></a>
<dt><a href="dtree.html" tppabs="http://hissa.nist.gov/dads/HTML/dtree.html"><em>D-tree</em></a>
<dt><a href="dual.html" tppabs="http://hissa.nist.gov/dads/HTML/dual.html"><em>dual</em></a> [<strong>D</strong>]
<dt><a href="duallinear.html" tppabs="http://hissa.nist.gov/dads/HTML/duallinear.html"><em>dual linear program</em></a> [<strong>D</strong>]
<dt><a href="dutchnatlflg.html" tppabs="http://hissa.nist.gov/dads/HTML/dutchnatlflg.html"><em>Dutch National Flag</em></a> [<strong>A</strong>]
<dt><a href="dynamic.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamic.html"><em>dynamic</em></a> [<strong>D</strong>]
<dt><a href="dynamicarray.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamicarray.html"><em>dynamic array</em></a>
<dt><a href="dynamichash.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamichash.html"><em>dynamic hashing</em></a>
<dt><a href="dynamicprog.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamicprog.html"><em>dynamic programming</em></a> [<strong>T</strong>]
<dt><a href="dynamicset.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamicset.html"><em>dynamic set sorting</em></a>
<dt><a href="dynamicsize.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamicsize.html"><em>dynamic size hashing</em></a>
<dt><a href="dynamictree.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamictree.html"><em>dynamic tree</em></a>
<dt><a href="dynamization.html" tppabs="http://hissa.nist.gov/dads/HTML/dynamization.html"><em>dynamization transformation</em></a> [<strong>T</strong>]
</dl>

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

<dl>
<dt><a href="edge.html" tppabs="http://hissa.nist.gov/dads/HTML/edge.html"><em>edge</em></a> [<strong>D</strong>]