﻿<?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++博客-重剑无锋-最新评论</title><link>http://www.cppblog.com/fm369o802340/CommentsRSS.aspx</link><description>我生待明日,万事成蹉跎</description><language>zh-cn</language><pubDate>Fri, 06 Mar 2015 09:10:48 GMT</pubDate><lastBuildDate>Fri, 06 Mar 2015 09:10:48 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 判断一个图是否是一个树（有向图）</title><link>http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207054</link><dc:creator>郭帅</dc:creator><author>郭帅</author><pubDate>Thu, 22 May 2014 05:12:00 GMT</pubDate><guid>http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207054</guid><description><![CDATA[我有算法，但是不会编程，请教下你<img src ="http://www.cppblog.com/fm369o802340/aggbug/207054.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fm369o802340/" target="_blank">郭帅</a> 2014-05-22 13:12 <a href="http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207054#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断一个图是否是一个树（有向图，无向图）</title><link>http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207053</link><dc:creator>郭帅</dc:creator><author>郭帅</author><pubDate>Thu, 22 May 2014 05:11:00 GMT</pubDate><guid>http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207053</guid><description><![CDATA[图为一部分排水管道与进水口抽象成的一个有向连通图,结点表示进水口点,箭头方向表示排水管道排水的走向. 用邻接矩阵 来表示有向图 ,若 与 相邻接,则 ,若 与 不邻接,则 . 为所有结点的集合, 为已找到的结点的序列集合,它的初始状态为空集.<br>步骤1 选择结点 使得 的出度为0,即 ,令<br> <br>步骤2 从搜索结点 开始搜索以 为结点的所有前继结点 ,则<br> <br>步骤3 令 为 序列中 的下一个结点,执行步骤3,直到 的前继结点为空集结点为止.这样,便可得由集合 中的结点构成的一棵树.<br><img src ="http://www.cppblog.com/fm369o802340/aggbug/207053.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fm369o802340/" target="_blank">郭帅</a> 2014-05-22 13:11 <a href="http://www.cppblog.com/fm369o802340/archive/2014/05/22/196151.html#207053#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 这是一个新的开始</title><link>http://www.cppblog.com/fm369o802340/archive/2012/07/08/181412.html#182240</link><dc:creator>Gin</dc:creator><author>Gin</author><pubDate>Sun, 08 Jul 2012 15:08:00 GMT</pubDate><guid>http://www.cppblog.com/fm369o802340/archive/2012/07/08/181412.html#182240</guid><description><![CDATA[@lxchristina<br>写写,今天晚上的题一次AC,感觉很好.<br><img src ="http://www.cppblog.com/fm369o802340/aggbug/182240.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fm369o802340/" target="_blank">Gin</a> 2012-07-08 23:08 <a href="http://www.cppblog.com/fm369o802340/archive/2012/07/08/181412.html#182240#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 这是一个新的开始</title><link>http://www.cppblog.com/fm369o802340/archive/2012/07/05/181412.html#181535</link><dc:creator>lxchristina</dc:creator><author>lxchristina</author><pubDate>Thu, 05 Jul 2012 13:38:00 GMT</pubDate><guid>http://www.cppblog.com/fm369o802340/archive/2012/07/05/181412.html#181535</guid><description><![CDATA[一直支持，嘿嘿<img src ="http://www.cppblog.com/fm369o802340/aggbug/181535.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/fm369o802340/" target="_blank">lxchristina</a> 2012-07-05 21:38 <a href="http://www.cppblog.com/fm369o802340/archive/2012/07/05/181412.html#181535#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>