termstype.html
来自「数据结构词典（英文）」· HTML 代码 · 共 651 行 · 第 1/5 页
HTML
651 行
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<!-- *created "Wed Nov 18 08:51:04 1998" *by "Paul E. Black" -->
<!-- *modified "Wed Dec 29 12:24:53 1999" *by "Paul E. Black" -->
<TITLE>Terms and Definitions Index by Type</TITLE>
<META name="description"
content="Index by type to definitions of algorithms, data
structures, and CS problems">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<CENTER> <H1>Index by Type</H1> </CENTER>
<CENTER> <H3>of</H3> </CENTER>
<CENTER> <H1><A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A></H1> </CENTER>
<CENTER> <H3>compiled originally for the</H3> </CENTER>
<CENTER> <H2>CRC Dictionary of Computer Science, Engineering and
Technology</H2> </CENTER>
<HR>
<P>
This is the web page of terms with definitions organized by type.
That is, whether the term is an algorithm, a definition, a
problem, or data structure. We also list all
<A HREF="termsImpl.html" tppabs="http://hissa.nist.gov/dads/termsImpl.html">entries with links to implementations</A>
and
<A HREF="termsArea.html" tppabs="http://hissa.nist.gov/dads/termsArea.html">entries by area</A>, for instance, graphs,
trees, sorting, etc.
<P>
We need people to contribute.
If terms are missing or you can add or correct
definitions, please contact
<A HREF="javascript:if(confirm('http://hissa.nist.gov/~black/ \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/'" tppabs="http://hissa.nist.gov/~black/">me</A> by email
(<A HREF="mailto:paul.black@nist.gov">paul.black@nist.gov</A>) or by
other means.
<HR>
<!-- this is joined with indices and a conclusion to make a complete page -->
<!-- end of termsType.intro -->
<P>
Run on Thu Jan 20 16:53:22 2000
<h3>Types</h3>
<ul>
<li><a href="#P">Classic Problems</a>
<li><a href="#A">Algorithms</a>
<li><a href="#S">Data Structures</a>
<li><a href="#D">Definitions</a>
<li><a href="#T">Algorithmic Techniques</a>
<li><a href="#notype">Entries with No Type</a>
</ul>
<hr>
<h2><a name="P">Classic Problems</a></h2>
<ul>
<li><a href="allpairsshrt.html" tppabs="http://hissa.nist.gov/dads/HTML/allpairsshrt.html">all pairs shortest path</a>
<li><a href="approxstrmat.html" tppabs="http://hissa.nist.gov/dads/HTML/approxstrmat.html">approximate string match</a>
<li><a href="assignment.html" tppabs="http://hissa.nist.gov/dads/HTML/assignment.html">assignment problem</a>
<li><a href="binpacking.html" tppabs="http://hissa.nist.gov/dads/HTML/binpacking.html">bin packing</a>
<li><a href="btltravsale.html" tppabs="http://hissa.nist.gov/dads/HTML/btltravsale.html">bottleneck traveling salesman</a>
<li><a href="byzantine.html" tppabs="http://hissa.nist.gov/dads/HTML/byzantine.html">Byzantine generals</a>
<li><a href="capacifacloc.html" tppabs="http://hissa.nist.gov/dads/HTML/capacifacloc.html">capacitated facility location</a>
<li><a href="chinesePstmn.html" tppabs="http://hissa.nist.gov/dads/HTML/chinesePstmn.html">Chinese postman problem</a>
<li><a href="cliqueproblm.html" tppabs="http://hissa.nist.gov/dads/HTML/cliqueproblm.html">clique problem</a>
<li><a href="criticalPath.html" tppabs="http://hissa.nist.gov/dads/HTML/criticalPath.html">critical path problem</a>
<li><a href="diningphilos.html" tppabs="http://hissa.nist.gov/dads/HTML/diningphilos.html">dining philosophers</a>
<li><a href="discretpcntr.html" tppabs="http://hissa.nist.gov/dads/HTML/discretpcntr.html">discrete p-center</a>
<li><a href="eightqueens.html" tppabs="http://hissa.nist.gov/dads/HTML/eightqueens.html">eight queens</a>
<li><a href="elementnqnss.html" tppabs="http://hissa.nist.gov/dads/HTML/elementnqnss.html">element uniqueness</a>
<li><a href="euclidntrvls.html" tppabs="http://hissa.nist.gov/dads/HTML/euclidntrvls.html">Euclidean traveling salesman problem</a>
<li><a href="facilityloc.html" tppabs="http://hissa.nist.gov/dads/HTML/facilityloc.html">facility location</a>
<li><a href="finitestmmin.html" tppabs="http://hissa.nist.gov/dads/HTML/finitestmmin.html">finite state machine minimization</a>
<li><a href="fractnlknpsk.html" tppabs="http://hissa.nist.gov/dads/HTML/fractnlknpsk.html">fractional knapsack problem</a>
<li><a href="graphdrawing.html" tppabs="http://hissa.nist.gov/dads/HTML/graphdrawing.html">graph drawing</a>
<li><a href="graphisomrph.html" tppabs="http://hissa.nist.gov/dads/HTML/graphisomrph.html">graph isomorphism</a>
<li><a href="haltingprblm.html" tppabs="http://hissa.nist.gov/dads/HTML/haltingprblm.html">halting problem</a>
<li><a href="knapsckprblm.html" tppabs="http://hissa.nist.gov/dads/HTML/knapsckprblm.html">knapsack problem</a>
<li><a href="longestcommn.html" tppabs="http://hissa.nist.gov/dads/HTML/longestcommn.html">longest common subsequence</a>
<li><a href="longstcmmnsb.html" tppabs="http://hissa.nist.gov/dads/HTML/longstcmmnsb.html">longest common substring</a>
<li><a href="matrxchnmltp.html" tppabs="http://hissa.nist.gov/dads/HTML/matrxchnmltp.html">matrix-chain multiplication problem</a>
<li><a href="maxmlndpndnt.html" tppabs="http://hissa.nist.gov/dads/HTML/maxmlndpndnt.html">maximal independent set</a>
<li><a href="maximumflow.html" tppabs="http://hissa.nist.gov/dads/HTML/maximumflow.html">maximum-flow problem</a>
<li><a href="networkflowp.html" tppabs="http://hissa.nist.gov/dads/HTML/networkflowp.html">network flow problem</a>
<li><a href="nqueens.html" tppabs="http://hissa.nist.gov/dads/HTML/nqueens.html">n queens</a>
<li><a href="optmlplygntr.html" tppabs="http://hissa.nist.gov/dads/HTML/optmlplygntr.html">optimal polygon triangulation problem</a>
<li><a href="optmltrngltn.html" tppabs="http://hissa.nist.gov/dads/HTML/optmltrngltn.html">optimal triangulation problem</a>
<li><a href="pathsystem.html" tppabs="http://hissa.nist.gov/dads/HTML/pathsystem.html">path system problem</a>
<li><a href="pcp.html" tppabs="http://hissa.nist.gov/dads/HTML/pcp.html">PCP</a>
<li><a href="postscrrspnd.html" tppabs="http://hissa.nist.gov/dads/HTML/postscrrspnd.html">Post's correspondence problem</a>
<li><a href="prisonerdilm.html" tppabs="http://hissa.nist.gov/dads/HTML/prisonerdilm.html">prisoner's dilema</a>
<li><a href="selectnpart.html" tppabs="http://hissa.nist.gov/dads/HTML/selectnpart.html">select and partition</a>
<li><a href="selectnprblm.html" tppabs="http://hissa.nist.gov/dads/HTML/selectnprblm.html">selection problem</a>
<li><a href="selectkth.html" tppabs="http://hissa.nist.gov/dads/HTML/selectkth.html">select k<sup>th</sup> element</a>
<li><a href="shortestpath.html" tppabs="http://hissa.nist.gov/dads/HTML/shortestpath.html">shortest path</a>
<li><a href="singldstntns.html" tppabs="http://hissa.nist.gov/dads/HTML/singldstntns.html">single-destination shortest-path problem</a>
<li><a href="singlsrcshrt.html" tppabs="http://hissa.nist.gov/dads/HTML/singlsrcshrt.html">single-source shortest-path problem</a>
<li><a href="slopeselectn.html" tppabs="http://hissa.nist.gov/dads/HTML/slopeselectn.html">slope selection</a>
<li><a href="stringmatch.html" tppabs="http://hissa.nist.gov/dads/HTML/stringmatch.html">string match</a>
<li><a href="stringmaterr.html" tppabs="http://hissa.nist.gov/dads/HTML/stringmaterr.html">string match with errors</a>
<li><a href="subgraphiso.html" tppabs="http://hissa.nist.gov/dads/HTML/subgraphiso.html">subgraph isomorphism</a>
<li><a href="towershanoi.html" tppabs="http://hissa.nist.gov/dads/HTML/towershanoi.html">towers of Hanoi</a>
<li><a href="travelsales.html" tppabs="http://hissa.nist.gov/dads/HTML/travelsales.html">traveling salesman</a>
<li><a href="tsp.html" tppabs="http://hissa.nist.gov/dads/HTML/tsp.html">TSP</a>
<li><a href="vertexcover.html" tppabs="http://hissa.nist.gov/dads/HTML/vertexcover.html">vertex cover</a>
<li><a href="zero1knap.html" tppabs="http://hissa.nist.gov/dads/HTML/zero1knap.html">0-1 knapsack</a>
</ul>
<h2><a name="A">Algorithms</a></h2>
<ul>
<li><a href="ackermann.html" tppabs="http://hissa.nist.gov/dads/HTML/ackermann.html">Ackermann's function</a>
<li><a href="adaptivehpsr.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptivehpsr.html">adaptive heap sort</a>
<li><a href="adaptivhuffm.html" tppabs="http://hissa.nist.gov/dads/HTML/adaptivhuffm.html">adaptive Huffman encoding</a>
<li><a href="addresscalc.html" tppabs="http://hissa.nist.gov/dads/HTML/addresscalc.html">address-calculation sort</a>
<li><a href="algorithBSTW.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithBSTW.html">algorithm BSTW</a>
<li><a href="algorithmFGK.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithmFGK.html">algorithm FGK</a>
<li><a href="algorithmV.html" tppabs="http://hissa.nist.gov/dads/HTML/algorithmV.html">algorithm V</a>
<li><a href="alphaskipsr.html" tppabs="http://hissa.nist.gov/dads/HTML/alphaskipsr.html">Alpha Skip Search algorithm</a>
<li><a href="apostolicocr.html" tppabs="http://hissa.nist.gov/dads/HTML/apostolicocr.html">Apostolico-Crochemore</a>
<li><a href="apostolicogi.html" tppabs="http://hissa.nist.gov/dads/HTML/apostolicogi.html">Apostolico-Giancarlo algorithm</a>
<li><a href="balanckwayms.html" tppabs="http://hissa.nist.gov/dads/HTML/balanckwayms.html">balanced k-way merge sort</a>
<li><a href="balancmrgsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/balancmrgsrt.html">balanced merge sort</a>
<li><a href="balncdmltwym.html" tppabs="http://hissa.nist.gov/dads/HTML/balncdmltwym.html">balanced multiway merge</a>
<li><a href="balancedqsrt.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedqsrt.html">balanced quicksort</a>
<li><a href="balanc2wayms.html" tppabs="http://hissa.nist.gov/dads/HTML/balanc2wayms.html">balanced two-way merge sort</a>
<li><a href="bellmanford.html" tppabs="http://hissa.nist.gov/dads/HTML/bellmanford.html">Bellman-Ford algorithm</a>
<li><a href="bestfirst.html" tppabs="http://hissa.nist.gov/dads/HTML/bestfirst.html">best first search</a>
<li><a href="binaryinsort.html" tppabs="http://hissa.nist.gov/dads/HTML/binaryinsort.html">binary insertion sort</a>
<li><a href="binarysrch.html" tppabs="http://hissa.nist.gov/dads/HTML/binarysrch.html">binary search</a>
<li><a href="bingosort.html" tppabs="http://hissa.nist.gov/dads/HTML/bingosort.html">bingo sort</a>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?