index.htm

数据结构词典（英文）

<dt><a href="edgecoloring.html" tppabs="http://hissa.nist.gov/dads/HTML/edgecoloring.html"><em>edge coloring</em></a> [<strong>D</strong>]
<dt><a href="edgecnnctvty.html" tppabs="http://hissa.nist.gov/dads/HTML/edgecnnctvty.html"><em>edge connectivity</em></a> [<strong>D</strong>]
<dt><a href="edgecrossing.html" tppabs="http://hissa.nist.gov/dads/HTML/edgecrossing.html"><em>edge crossing</em></a> [<strong>D</strong>]
<dt><a href="editdistance.html" tppabs="http://hissa.nist.gov/dads/HTML/editdistance.html"><em>edit distance</em></a> [<strong>D</strong>]
<dt><a href="editoperatin.html" tppabs="http://hissa.nist.gov/dads/HTML/editoperatin.html"><em>edit operation</em></a> [<strong>D</strong>]
<dt><a href="editscript.html" tppabs="http://hissa.nist.gov/dads/HTML/editscript.html"><em>edit script</em></a> [<strong>D</strong>]
<dt><a href="efficiency.html" tppabs="http://hissa.nist.gov/dads/HTML/efficiency.html"><em>efficiency</em></a> [<strong>D</strong>]
<dt><a href="eightqueens.html" tppabs="http://hissa.nist.gov/dads/HTML/eightqueens.html"><em>eight queens</em></a> [<strong>P</strong>]
<dt><a href="elementnqnss.html" tppabs="http://hissa.nist.gov/dads/HTML/elementnqnss.html"><em>element uniqueness</em></a> [<strong>P</strong>]
<dt><a href="endofstring.html" tppabs="http://hissa.nist.gov/dads/HTML/endofstring.html"><em>end-of-string</em></a>
<dt><a href="entropysrch.html" tppabs="http://hissa.nist.gov/dads/HTML/entropysrch.html"><em>entropy searching</em></a>
<dt><a href="ercw.html" tppabs="http://hissa.nist.gov/dads/HTML/ercw.html"><em>ERCW</em></a> [<strong>D</strong>]
<dt><a href="erew.html" tppabs="http://hissa.nist.gov/dads/HTML/erew.html"><em>EREW</em></a> [<strong>D</strong>]
<dt><a href="euclidndstnc.html" tppabs="http://hissa.nist.gov/dads/HTML/euclidndstnc.html"><em>Euclidean distance</em></a> [<strong>D</strong>]
<dt><a href="euclidstntre.html" tppabs="http://hissa.nist.gov/dads/HTML/euclidstntre.html"><em>Euclidean Steiner tree</em></a> [<strong>D</strong>]
<dt><a href="euclidntrvls.html" tppabs="http://hissa.nist.gov/dads/HTML/euclidntrvls.html"><em>Euclidean traveling salesman problem</em></a> [<strong>P</strong>]
<dt><a href="euclidalgo.html" tppabs="http://hissa.nist.gov/dads/HTML/euclidalgo.html"><em>Euclid's algorithm</em></a> [<strong>A</strong>]
<dt><a href="eulercycle.html" tppabs="http://hissa.nist.gov/dads/HTML/eulercycle.html"><em>Euler cycle</em></a> [<strong>D</strong>]
<dt><a href="euleriangrph.html" tppabs="http://hissa.nist.gov/dads/HTML/euleriangrph.html"><em>Eulerian graph</em></a> [<strong>D</strong>]
<dt><a href="exactstr.html" tppabs="http://hissa.nist.gov/dads/HTML/exactstr.html"><em>exact string searching</em></a> [<strong>D</strong>]
<dt><a href="excell.html" tppabs="http://hissa.nist.gov/dads/HTML/excell.html"><em>EXCELL</em></a> [<strong>S</strong>]
<dt><a href="exclusiveor.html" tppabs="http://hissa.nist.gov/dads/HTML/exclusiveor.html"><em>exclusive or</em></a> [<strong>D</strong>]
<dt><a href="exclsvrdcncr.html" tppabs="http://hissa.nist.gov/dads/HTML/exclsvrdcncr.html"><em>exclusive read, concurrent write</em></a> [<strong>D</strong>]
<dt><a href="exclsvrdxcls.html" tppabs="http://hissa.nist.gov/dads/HTML/exclsvrdxcls.html"><em>exclusive read, exclusive write</em></a> [<strong>D</strong>]
<dt><a href="exhaustvsrch.html" tppabs="http://hissa.nist.gov/dads/HTML/exhaustvsrch.html"><em>exhaustive search</em></a> [<strong>T</strong>]
<dt><a href="existentlstt.html" tppabs="http://hissa.nist.gov/dads/HTML/existentlstt.html"><em>existential state</em></a> [<strong>D</strong>]
<dt><a href="expandergrph.html" tppabs="http://hissa.nist.gov/dads/HTML/expandergrph.html"><em>expander graph</em></a> [<strong>D</strong>]
<dt><a href="exponential.html" tppabs="http://hissa.nist.gov/dads/HTML/exponential.html"><em>exponential</em></a> [<strong>D</strong>]
<dt><a href="extnddbnrytr.html" tppabs="http://hissa.nist.gov/dads/HTML/extnddbnrytr.html"><em>extended binary tree</em></a>
<dt><a href="extendEuclid.html" tppabs="http://hissa.nist.gov/dads/HTML/extendEuclid.html"><em>extended Euclid's algorithm</em></a> [<strong>A</strong>]
<dt><a href="extendkdtree.html" tppabs="http://hissa.nist.gov/dads/HTML/extendkdtree.html"><em>extended k-d tree</em></a> [<strong>S</strong>]
<dt><a href="extendible.html" tppabs="http://hissa.nist.gov/dads/HTML/extendible.html"><em>extendible hashing</em></a>
<dt><a href="externalhsh.html" tppabs="http://hissa.nist.gov/dads/HTML/externalhsh.html"><em>external hashing</em></a>
<dt><a href="externalindx.html" tppabs="http://hissa.nist.gov/dads/HTML/externalindx.html"><em>external index</em></a> [<strong>S</strong>]
<dt><a href="externalmerg.html" tppabs="http://hissa.nist.gov/dads/HTML/externalmerg.html"><em>external merge</em></a> [<strong>A</strong>]
<dt><a href="externmrgsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/externmrgsrt.html"><em>external merge sort</em></a> [<strong>A</strong>]
<dt><a href="externalnode.html" tppabs="http://hissa.nist.gov/dads/HTML/externalnode.html"><em>external node</em></a>
<dt><a href="externalpth.html" tppabs="http://hissa.nist.gov/dads/HTML/externalpth.html"><em>external path</em></a>
<dt><a href="externquiksr.html" tppabs="http://hissa.nist.gov/dads/HTML/externquiksr.html"><em>external quicksort</em></a> [<strong>A</strong>]
<dt><a href="extrnlrdxsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/extrnlrdxsrt.html"><em>external radix sort</em></a> [<strong>A</strong>]
<dt><a href="external.html" tppabs="http://hissa.nist.gov/dads/HTML/external.html"><em>external searching</em></a>
<dt><a href="externalsort.html" tppabs="http://hissa.nist.gov/dads/HTML/externalsort.html"><em>external sort</em></a> [<strong>D</strong>]
<dt><a href="extractmxmm.html" tppabs="http://hissa.nist.gov/dads/HTML/extractmxmm.html"><em>extract maximum</em></a>
<dt><a href="extremal.html" tppabs="http://hissa.nist.gov/dads/HTML/extremal.html"><em>extremal</em></a> [<strong>D</strong>]
<dt><a href="extremepoint.html" tppabs="http://hissa.nist.gov/dads/HTML/extremepoint.html"><em>extreme point</em></a> [<strong>D</strong>]
</dl>

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

<dl>
<dt><a href="facilityloc.html" tppabs="http://hissa.nist.gov/dads/HTML/facilityloc.html"><em>facility location</em></a> [<strong>P</strong>]
<dt><a href="factor.html" tppabs="http://hissa.nist.gov/dads/HTML/factor.html"><em>factor</em></a> [<strong>D</strong>]
<dt><a href="factorial.html" tppabs="http://hissa.nist.gov/dads/HTML/factorial.html"><em>factorial</em></a> [<strong>D</strong>]
<dt><a href="failure.html" tppabs="http://hissa.nist.gov/dads/HTML/failure.html"><em>failure function</em></a>
<dt><a href="falsedrop.html" tppabs="http://hissa.nist.gov/dads/HTML/falsedrop.html"><em>false drop</em></a>
<dt><a href="fathoming.html" tppabs="http://hissa.nist.gov/dads/HTML/fathoming.html"><em>fathoming</em></a> [<strong>T</strong>]
<dt><a href="feasibleregn.html" tppabs="http://hissa.nist.gov/dads/HTML/feasibleregn.html"><em>feasible region</em></a> [<strong>D</strong>]
<dt><a href="feasiblesltn.html" tppabs="http://hissa.nist.gov/dads/HTML/feasiblesltn.html"><em>feasible solution</em></a> [<strong>D</strong>]
<dt><a href="feedbackedge.html" tppabs="http://hissa.nist.gov/dads/HTML/feedbackedge.html"><em>feedback edge</em></a> [<strong>D</strong>]
<dt><a href="fibonacnmbrs.html" tppabs="http://hissa.nist.gov/dads/HTML/fibonacnmbrs.html"><em>Fibonacci numbers</em></a> [<strong>D</strong>]
<dt><a href="fibonacsrch.html" tppabs="http://hissa.nist.gov/dads/HTML/fibonacsrch.html"><em>Fibonacci search</em></a> [<strong>A</strong>]
<dt><a href="fibonactree.html" tppabs="http://hissa.nist.gov/dads/HTML/fibonactree.html"><em>Fibonacci tree</em></a> [<strong>S</strong>]
<dt><a href="fibonacheap.html" tppabs="http://hissa.nist.gov/dads/HTML/fibonacheap.html"><em>Fibonnaci heap</em></a> [<strong>S</strong>]
<dt><a href="fifo.html" tppabs="http://hissa.nist.gov/dads/HTML/fifo.html"><em>FIFO</em></a> [<strong>S</strong>]
<dt><a href="find.html" tppabs="http://hissa.nist.gov/dads/HTML/find.html"><em>Find</em></a> [<strong>A</strong>]
<dt><a href="finitarytree.html" tppabs="http://hissa.nist.gov/dads/HTML/finitarytree.html"><em>finitary tree</em></a> [<strong>S</strong>]
<dt><a href="finiteautmtn.html" tppabs="http://hissa.nist.gov/dads/HTML/finiteautmtn.html"><em>finite automaton</em></a> [<strong>D</strong>]
<dt><a href="finitestautm.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestautm.html"><em>finite state automaton</em></a> [<strong>D</strong>]
<dt><a href="finitestate.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestate.html"><em>finite state machine</em></a> [<strong>D</strong>]
<dt><a href="finitestmmin.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestmmin.html"><em>finite state machine minimization</em></a> [<strong>P</strong>]
<dt><a href="finsttransdu.html" tppabs="http://hissa.nist.gov/dads/HTML/finsttransdu.html"><em>finite state transducer</em></a> [<strong>D</strong>]
<dt><a href="firstcome.html" tppabs="http://hissa.nist.gov/dads/HTML/firstcome.html"><em>first-come, first-served</em></a> [<strong>D</strong>]
<dt><a href="firstinfrstt.html" tppabs="http://hissa.nist.gov/dads/HTML/firstinfrstt.html"><em>first-in, first-out</em></a> [<strong>D</strong>]
<dt><a href="fixedgrdmthd.html" tppabs="http://hissa.nist.gov/dads/HTML/fixedgrdmthd.html"><em>fixed-grid method</em></a> [<strong>D</strong>]
<dt><a href="flow.html" tppabs="http://hissa.nist.gov/dads/HTML/flow.html"><em>flow</em></a> [<strong>D</strong>]
<dt><a href="flowconsrvtn.html" tppabs="http://hissa.nist.gov/dads/HTML/flowconsrvtn.html"><em>flow conservation</em></a> [<strong>D</strong>]
<dt><a href="flowfunction.html" tppabs="http://hissa.nist.gov/dads/HTML/flowfunction.html"><em>flow function</em></a> [<strong>D</strong>]
<dt><a href="flownetwork.html" tppabs="http://hissa.nist.gov/dads/HTML/flownetwork.html"><em>flow network</em></a> [<strong>D</strong>]
<dt><a href="floydheap.html" tppabs="http://hissa.nist.gov/dads/HTML/floydheap.html"><em>Floyd's heap-construction</em></a>
<dt><a href="floydWaralgo.html" tppabs="http://hissa.nist.gov/dads/HTML/floydWaralgo.html"><em>Floyd-Warshall algorithm</em></a> [<strong>A</strong>]
<dt><a href="fordFlkrsnmt.html" tppabs="http://hissa.nist.gov/dads/HTML/fordFlkrsnmt.html"><em>Ford-Folkerson method</em></a> [<strong>A</strong>]
<dt><a href="forest.html" tppabs="http://hissa.nist.gov/dads/HTML/forest.html"><em>forest</em></a> [<strong>D</strong>]
<dt><a href="forestedit.html" tppabs="http://hissa.nist.gov/dads/HTML/forestedit.html"><em>forest editing problem</em></a> [<strong>D</strong>]
<dt><a href="formallangug.html" tppabs="http://hissa.nist.gov/dads/HTML/formallangug.html"><em>formal language</em></a> [<strong>D</strong>]
<dt><a href="formalmethod.html" tppabs="http://hissa.nist.gov/dads/HTML/formalmethod.html"><em>formal methods</em></a> [<strong>D</strong>]
<dt><a href="formalverf.html" tppabs="http://hissa.nist.gov/dads/HTML/formalverf.html"><em>formal verification</em></a> [<strong>D</strong>]
<dt><a href="fractal.html" tppabs="http://hissa.nist.gov/dads/HTML/fractal.html"><em>fractal</em></a>
<dt><a href="fractnlknpsk.html" tppabs="http://hissa.nist.gov/dads/HTML/fractnlknpsk.html"><em>fractional knapsack problem</em></a> [<strong>P</strong>]
<dt><a href="fractional.html" tppabs="http://hissa.nist.gov/dads/HTML/fractional.html"><em>fractional solution</em></a> [<strong>D</strong>]
<dt><a href="freeedge.html" tppabs="http://hissa.nist.gov/dads/HTML/freeedge.html"><em>free edge</em></a> [<strong>D</strong>]
<dt><a href="freelist.html" tppabs="http://hissa.nist.gov/dads/HTML/freelist.html"><em>free list</em></a>
<dt><a href="freetree.html" tppabs="http://hissa.nist.gov/dads/HTML/freetree.html"><em>free tree</em></a>
<dt><a href="freevertex.html" tppabs="http://hissa.nist.gov/dads/HTML/freevertex.html"><em>free vertex</em></a> [<strong>D</strong>]
<dt><a href="fringe.html" tppabs="http://hissa.nist.gov/dads/HTML/fringe.html"><em>fringe reorganization</em></a>
<dt><a href="fullbintree.html" tppabs="http://hissa.nist.gov/dads/HTML/fullbintree.html"><em>full binary tree</em></a> [<strong>D</strong>]
<dt><a href="fullexpansn.html" tppabs="http://hissa.nist.gov/dads/HTML/fullexpansn.html"><em>full expansion</em></a>
<dt><a href="fullstablty.html" tppabs="http://hissa.nist.gov/dads/HTML/fullstablty.html"><em>full stability</em></a>
<dt><a href="fullSteinrTr.html" tppabs="http://hissa.nist.gov/dads/HTML/fullSteinrTr.html"><em>full Steiner tree</em></a>
<dt><a href="fullydynamic.html" tppabs="http://hissa.nist.gov/dads/HTML/fullydynamic.html"><em>fully dynamic graph problem</em></a> [<strong>D</strong>]
<dt><a href="ful.html" tppabs="http://hissa.nist.gov/dads/HTML/ful.html"><em>fully persistent data structure</em></a> [<strong>D</strong>]
<dt><a href="fullypolynml.html" tppabs="http://hissa.nist.gov/dads/HTML/fullypolynml.html"><em>fully polynomial approximation scheme</em></a> [<strong>T</strong>]
<dt><a href="function.html" tppabs="http://hissa.nist.gov/dads/HTML/function.html"><em>function</em></a> [<strong>D</strong>]
<dt><a href="functnldtstr.html" tppabs="http://hissa.nist.gov/dads/HTML/functnldtstr.html"><em>functional data structure</em></a>
<dt><a href="fusiontree.html" tppabs="http://hissa.nist.gov/dads/HTML/fusiontree.html"><em>fusion tree</em></a> [<strong>S</strong>]
<dt><a href="fuzzyedge.html" tppabs="http://hissa.nist.gov/dads/HTML/fuzzyedge.html"><em>fuzzy edge</em></a> [<strong>D</strong>]
<dt><a href="fuzzygraph.html" tppabs="http://hissa.nist.gov/dads/HTML/fuzzygraph.html"><em>fuzzy graph</em></a> [<strong>D</strong>]
<dt><a href="fuzzynode.html" tppabs="http://hissa.nist.gov/dads/HTML/fuzzynode.html"><em>fuzzy node</em></a> [<strong>D</strong>]
<dt><a href="fuzzyset.html" tppabs="http://hissa.nist.gov/dads/HTML/fuzzyset.html"><em>fuzzy set</em></a> [<strong>D</strong>]
</dl>

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

<dl>
<dt><a href="galilgiancar.html" tppabs="http://hissa.nist.gov/dads/HTML/galilgiancar.html"><em>Galil-Gianca