<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>梁田的专栏 - 数据结构与算法</title><link>http://blog.csdn.net/czlt86/category/258344.aspx</link><description>学习数据结构与算法的心得</description><dc:language>zh-CN</dc:language><lastUpdateTime>Thu, 10 Jan 2008 12:12:42 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>czlt</dc:creator><title>总结：几种常见的查找算法</title><link>http://blog.csdn.net/czlt86/archive/2007/02/25/1514246.aspx</link><pubDate>Sun, 25 Feb 2007 19:44:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2007/02/25/1514246.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1514246.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2007/02/25/1514246.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1514246.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1514246</trackback:ping><description>几种常见的查找算法，c语言描述&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1514246.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>总结：几种常见的内部排序方法</title><link>http://blog.csdn.net/czlt86/archive/2007/02/10/1507035.aspx</link><pubDate>Sat, 10 Feb 2007 13:20:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2007/02/10/1507035.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1507035.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2007/02/10/1507035.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1507035.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1507035</trackback:ping><description>用C语言描述&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1507035.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>图的遍历</title><link>http://blog.csdn.net/czlt86/archive/2006/12/14/1443308.aspx</link><pubDate>Thu, 14 Dec 2006 22:54:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/12/14/1443308.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1443308.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/12/14/1443308.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1443308.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1443308</trackback:ping><description>图的深度优先遍历和广度优先遍历&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1443308.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>用邻接表表示的有向网</title><link>http://blog.csdn.net/czlt86/archive/2006/12/10/1437223.aspx</link><pubDate>Sun, 10 Dec 2006 14:11:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/12/10/1437223.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1437223.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/12/10/1437223.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1437223.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1437223</trackback:ping><description>用邻接表表示的有向网&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1437223.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>用十字链表表示的有向图</title><link>http://blog.csdn.net/czlt86/archive/2006/12/10/1437219.aspx</link><pubDate>Sun, 10 Dec 2006 14:10:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/12/10/1437219.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1437219.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/12/10/1437219.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1437219.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1437219</trackback:ping><description>用十字链表表示的有向图&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1437219.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>呵呵,今天的成果!!图的数组表示法</title><link>http://blog.csdn.net/czlt86/archive/2006/12/06/1432666.aspx</link><pubDate>Wed, 06 Dec 2006 22:53:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/12/06/1432666.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1432666.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/12/06/1432666.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1432666.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1432666</trackback:ping><description>图的数组表示法&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1432666.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>今天学会了最优二叉树的写法！！！</title><link>http://blog.csdn.net/czlt86/archive/2006/12/02/1427306.aspx</link><pubDate>Sat, 02 Dec 2006 22:28:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/12/02/1427306.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1427306.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/12/02/1427306.aspx#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1427306.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1427306</trackback:ping><description>最优二叉树（哈夫曼树）的建立以及求哈夫曼编码&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1427306.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>建立中序线索二叉树</title><link>http://blog.csdn.net/czlt86/archive/2006/11/29/1419777.aspx</link><pubDate>Wed, 29 Nov 2006 12:23:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/11/29/1419777.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1419777.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/11/29/1419777.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1419777.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1419777</trackback:ping><description>建立中序线索二叉树方法&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1419777.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>终于会写二叉树了！贴出来高兴一下</title><link>http://blog.csdn.net/czlt86/archive/2006/11/27/1416580.aspx</link><pubDate>Mon, 27 Nov 2006 12:41:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/11/27/1416580.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1416580.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/11/27/1416580.aspx#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1416580.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1416580</trackback:ping><description>二叉树的基本算法实现&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1416580.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>文本编辑器</title><link>http://blog.csdn.net/czlt86/archive/2006/11/26/1415386.aspx</link><pubDate>Sun, 26 Nov 2006 17:37:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/11/26/1415386.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1415386.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/11/26/1415386.aspx#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1415386.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1415386</trackback:ping><description>先姑且叫做＂文本编辑器＂吧&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1415386.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>学数据结构的意义</title><link>http://blog.csdn.net/czlt86/archive/2006/11/26/1415385.aspx</link><pubDate>Sun, 26 Nov 2006 17:35:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/11/26/1415385.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1415385.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/11/26/1415385.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1415385.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1415385</trackback:ping><description>看到关于数据结构的一句话，觉得很是贴切&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1415385.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>czlt</dc:creator><title>今天学会了用于模式匹配的ＫＭＰ算法，思路太精彩了！！ </title><link>http://blog.csdn.net/czlt86/archive/2006/11/26/1415380.aspx</link><pubDate>Sun, 26 Nov 2006 17:31:00 GMT</pubDate><guid>http://blog.csdn.net/czlt86/archive/2006/11/26/1415380.aspx</guid><wfw:comment>http://blog.csdn.net/czlt86/comments/1415380.aspx</wfw:comment><comments>http://blog.csdn.net/czlt86/archive/2006/11/26/1415380.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/czlt86/comments/commentRss/1415380.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1415380</trackback:ping><description>用于串的模式匹配&lt;img src ="http://blog.csdn.net/czlt86/aggbug/1415380.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>