算法与数据结构百科全书

Status,Title,URL,LocalFile,FileType,Size,LastModified,DownloadResult,Level,Referrer "Parsed","Dictionary of Algorithms and Data Structures","http://xw2k.nist.gov/dads/","../dads.html","HTML","91932","Mon, 27 Sep 2010 17:04:40 GMT","200 OK","0","" "Error","","http://xw2k.nist.gov/dads/favicon.ico","../favicon.ico","Graphics","0","","404 Not Found","1","http://xw2k.nist.gov/dads/" "Saved","","http://xw2k.nist.gov/dads/Images/webidblue_1linecentr.gif","../webidblue_1linecentr.gif","Images","1205","Wed, 16 Aug 2000 19:56:48 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Ackermann's function","http://xw2k.nist.gov/dads/HTML/ackermann.html","../ackermann.html","HTML","4019","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","traveling salesman","http://xw2k.nist.gov/dads/HTML/travelingSalesman.html","../travelingSalesman.html","HTML","4723","Mon, 27 Sep 2010 14:31:24 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Byzantine generals","http://xw2k.nist.gov/dads/HTML/byzantine.html","../byzantine.html","HTML","3895","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Terms and Definitions with Implementation Links","http://xw2k.nist.gov/dads/termsImpl.html","../termsImpl.html","HTML","78042","Mon, 27 Sep 2010 17:04:40 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Terms and Definitions Index by Area","http://xw2k.nist.gov/dads/termsArea.html","../termsArea.html","HTML","105182","Mon, 27 Sep 2010 17:04:42 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Terms and Definitions Index by Type","http://xw2k.nist.gov/dads/termsType.html","../termsType.html","HTML","77636","Mon, 27 Sep 2010 17:04:42 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","DADS Index","http://xw2k.nist.gov/dads/terms2.html","../terms2.html","HTML","3866","Mon, 27 Sep 2010 17:04:40 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","inverse Ackermann function","http://xw2k.nist.gov/dads/HTML/inverseAckermann.html","../inverseAckermann.html","HTML","2666","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","omega","http://xw2k.nist.gov/dads/HTML/omega.html","../omega.html","HTML","2625","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Omega","http://xw2k.nist.gov/dads/HTML/omegaCapital.html","../omegaCapital.html","HTML","3280","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","rho-approximation algorithm","http://xw2k.nist.gov/dads/HTML/rhoapproxmtn.html","../rhoapproxmtn.html","HTML","2671","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","sim","http://xw2k.nist.gov/dads/HTML/sim.html","../sim.html","HTML","2588","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Saved","","http://xw2k.nist.gov/dads/Images/sim.gif","../sim.gif","Images","51","Wed, 04 Feb 2004 20:49:12 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Theta","http://xw2k.nist.gov/dads/HTML/theta.html","../theta.html","HTML","3246","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","absolute performance guarantee","http://xw2k.nist.gov/dads/HTML/absolute.html","../absolute.html","HTML","2495","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","abstract data type","http://xw2k.nist.gov/dads/HTML/abstractDataType.html","../abstractDataType.html","HTML","3931","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","(a,b)-tree","http://xw2k.nist.gov/dads/HTML/abtree.html","../abtree.html","HTML","2619","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","accepting state","http://xw2k.nist.gov/dads/HTML/acceptingstt.html","../acceptingstt.html","HTML","2322","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","active data structure","http://xw2k.nist.gov/dads/HTML/activeDataStruc.html","../activeDataStruc.html","HTML","2980","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","directed acyclic graph","http://xw2k.nist.gov/dads/HTML/directAcycGraph.html","../directAcycGraph.html","HTML","2547","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","acyclic graph","http://xw2k.nist.gov/dads/HTML/acyclicgraph.html","../acyclicgraph.html","HTML","2596","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adaptive heapsort","http://xw2k.nist.gov/dads/HTML/adaptiveHeapSort.html","../adaptiveHeapSort.html","HTML","1922","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adaptive Huffman coding","http://xw2k.nist.gov/dads/HTML/adaptiveHuffman.html","../adaptiveHuffman.html","HTML","2954","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adaptive k-d tree","http://xw2k.nist.gov/dads/HTML/adaptkdtree.html","../adaptkdtree.html","HTML","2152","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adaptive sort","http://xw2k.nist.gov/dads/HTML/adaptivesort.html","../adaptivesort.html","HTML","2445","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","address-calculation sort","http://xw2k.nist.gov/dads/HTML/addresscalc.html","../addresscalc.html","HTML","2385","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adjacency-list representation","http://xw2k.nist.gov/dads/HTML/adjacencyListRep.html","../adjacencyListRep.html","HTML","3417","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adjacency-matrix representation","http://xw2k.nist.gov/dads/HTML/adjacencyMatrixRep.html","../adjacencyMatrixRep.html","HTML","3648","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adjacent","http://xw2k.nist.gov/dads/HTML/adjacent.html","../adjacent.html","HTML","2428","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","admissible vertex","http://xw2k.nist.gov/dads/HTML/admissible.html","../admissible.html","HTML","2233","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","adversary","http://xw2k.nist.gov/dads/HTML/adversary.html","../adversary.html","HTML","2434","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","Aho-Corasick","http://xw2k.nist.gov/dads/HTML/ahoCorasick.html","../ahoCorasick.html","HTML","3168","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","algorithm","http://xw2k.nist.gov/dads/HTML/algorithm.html","../algorithm.html","HTML","2886","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","algorithm BSTW","http://xw2k.nist.gov/dads/HTML/algorithmBSTW.html","../algorithmBSTW.html","HTML","2132","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","algorithm FGK","http://xw2k.nist.gov/dads/HTML/algorithmFGK.html","../algorithmFGK.html","HTML","2556","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","decidable problem","http://xw2k.nist.gov/dads/HTML/decidableProblem.html","../decidableProblem.html","HTML","3024","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","all pairs shortest path","http://xw2k.nist.gov/dads/HTML/allPairsShortestPath.html","../allPairsShortestPath.html","HTML","2942","Mon, 27 Sep 2010 14:31:22 GMT","206 Partial Content","1","http://xw2k.nist.gov/dads/" "Parsed","all simple paths","http://xw2k.nist.gov/dads/HTML/allSimplePaths.html","../allSimplePaths.html","HTML","2663","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k.nist.gov/dads/" "Parsed","alphabet","http://xw2k.nist.gov/dads/HTML/alphabet.html","../alphabet.html","HTML","2420","Mon, 27 Sep 2010 14:31:22 GMT","200 OK","1","http://xw2k