﻿<?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++博客-The Way of C++ -随笔分类-DataStruct And Algorithm</title><link>http://www.cppblog.com/koson/category/5829.html</link><description /><language>zh-cn</language><lastBuildDate>Fri, 23 May 2008 00:42:17 GMT</lastBuildDate><pubDate>Fri, 23 May 2008 00:42:17 GMT</pubDate><ttl>60</ttl><item><title>Euler Circle Problem</title><link>http://www.cppblog.com/koson/archive/2007/12/21/39243.html</link><dc:creator>koson</dc:creator><author>koson</author><pubDate>Fri, 21 Dec 2007 11:36:00 GMT</pubDate><guid>http://www.cppblog.com/koson/archive/2007/12/21/39243.html</guid><wfw:comment>http://www.cppblog.com/koson/comments/39243.html</wfw:comment><comments>http://www.cppblog.com/koson/archive/2007/12/21/39243.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/koson/comments/commentRss/39243.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/koson/services/trackbacks/39243.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: undirect graph euler circle, direct graph euler circle, mix graph euler circle, fleury algorithm <br>&nbsp;&nbsp;<a href='http://www.cppblog.com/koson/archive/2007/12/21/39243.html'>阅读全文</a><img src ="http://www.cppblog.com/koson/aggbug/39243.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/koson/" target="_blank">koson</a> 2007-12-21 19:36 <a href="http://www.cppblog.com/koson/archive/2007/12/21/39243.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Maximum Bipartite Matching</title><link>http://www.cppblog.com/koson/archive/2007/12/21/39225.html</link><dc:creator>koson</dc:creator><author>koson</author><pubDate>Fri, 21 Dec 2007 06:53:00 GMT</pubDate><guid>http://www.cppblog.com/koson/archive/2007/12/21/39225.html</guid><wfw:comment>http://www.cppblog.com/koson/comments/39225.html</wfw:comment><comments>http://www.cppblog.com/koson/archive/2007/12/21/39225.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/koson/comments/commentRss/39225.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/koson/services/trackbacks/39225.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: maximum bipartite matching , minimum coverage number, Hugary Algorithm, maximum independent set problem ,perfect mathing&nbsp;&nbsp;<a href='http://www.cppblog.com/koson/archive/2007/12/21/39225.html'>阅读全文</a><img src ="http://www.cppblog.com/koson/aggbug/39225.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/koson/" target="_blank">koson</a> 2007-12-21 14:53 <a href="http://www.cppblog.com/koson/archive/2007/12/21/39225.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>