﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-yuyang7的部落格-随笔分类-数据结构</title><link>http://www.cppblog.com/yuyang7/category/9968.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 04 Apr 2009 03:17:19 GMT</lastBuildDate><pubDate>Sat, 04 Apr 2009 03:17:19 GMT</pubDate><ttl>60</ttl><item><title>Suffix Tree—后缀树</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Sun, 29 Mar 2009 05:05:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78252.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78252.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78252.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 后缀树是一种PAT树，它描述了给定字符串的所有后缀，许多重要的字符串操作都能够在后缀树上快速地实现。&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78252.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-29 13:05 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/29/78252.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Trie—单词查找树</title><link>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html</link><dc:creator>yuyang7</dc:creator><author>yuyang7</author><pubDate>Fri, 27 Mar 2009 15:51:00 GMT</pubDate><guid>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html</guid><wfw:comment>http://www.cppblog.com/yuyang7/comments/78083.html</wfw:comment><comments>http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cppblog.com/yuyang7/comments/commentRss/78083.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/yuyang7/services/trackbacks/78083.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Trie，又称单词查找树、前缀树，是一种哈希树的变种。应用于字符串的统计与排序，经常被搜索引擎系统用于文本词频统计。<br><br>&nbsp;&nbsp;<a href='http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html'>阅读全文</a><img src ="http://www.cppblog.com/yuyang7/aggbug/78083.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/yuyang7/" target="_blank">yuyang7</a> 2009-03-27 23:51 <a href="http://www.cppblog.com/yuyang7/archive/2009/03/27/78083.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>