﻿<?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++博客-namespace SleeplessCPlusPlus-最新评论</title><link>http://www.cppblog.com/mjsz-cppblog/CommentsRSS.aspx</link><description>Think Different, Take Action</description><language>zh-cn</language><pubDate>Thu, 07 Jun 2018 12:09:50 GMT</pubDate><lastBuildDate>Thu, 07 Jun 2018 12:09:50 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 使用优先队列的 Dijkstra 算法</title><link>http://www.cppblog.com/mjsz-cppblog/archive/2016/01/05/194177.html#212602</link><dc:creator>Sleepless Loki</dc:creator><author>Sleepless Loki</author><pubDate>Tue, 05 Jan 2016 00:06:00 GMT</pubDate><guid>http://www.cppblog.com/mjsz-cppblog/archive/2016/01/05/194177.html#212602</guid><description><![CDATA[@shop as roma<br>我最近在研究Facebook的开源库，folly容器的效率比stl的更好。<br><a target="_new" href="https://github.com/facebook/folly/tree/master/folly">https://github.com/facebook/folly/tree/master/folly</a><img src ="http://www.cppblog.com/mjsz-cppblog/aggbug/212602.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mjsz-cppblog/" target="_blank">Sleepless Loki</a> 2016-01-05 08:06 <a href="http://www.cppblog.com/mjsz-cppblog/archive/2016/01/05/194177.html#212602#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 使用优先队列的 Dijkstra 算法</title><link>http://www.cppblog.com/mjsz-cppblog/archive/2015/11/19/194177.html#212280</link><dc:creator>shop as roma</dc:creator><author>shop as roma</author><pubDate>Wed, 18 Nov 2015 16:03:00 GMT</pubDate><guid>http://www.cppblog.com/mjsz-cppblog/archive/2015/11/19/194177.html#212280</guid><description><![CDATA[用stl挺耗空间的. 很赞同。 我的空间也是<img src ="http://www.cppblog.com/mjsz-cppblog/aggbug/212280.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mjsz-cppblog/" target="_blank">shop as roma</a> 2015-11-19 00:03 <a href="http://www.cppblog.com/mjsz-cppblog/archive/2015/11/19/194177.html#212280#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 使用优先队列的 Dijkstra 算法</title><link>http://www.cppblog.com/mjsz-cppblog/archive/2012/11/09/194177.html#194971</link><dc:creator>Spix Mojo</dc:creator><author>Spix Mojo</author><pubDate>Fri, 09 Nov 2012 05:34:00 GMT</pubDate><guid>http://www.cppblog.com/mjsz-cppblog/archive/2012/11/09/194177.html#194971</guid><description><![CDATA[是为了代码的可读性吧<br>有的时候显式的数据结构写起来太麻烦了<br>STL可以增强代码的可读性<br>@Maigo<br><img src ="http://www.cppblog.com/mjsz-cppblog/aggbug/194971.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mjsz-cppblog/" target="_blank">Spix Mojo</a> 2012-11-09 13:34 <a href="http://www.cppblog.com/mjsz-cppblog/archive/2012/11/09/194177.html#194971#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 使用优先队列的 Dijkstra 算法</title><link>http://www.cppblog.com/mjsz-cppblog/archive/2012/11/04/194177.html#194532</link><dc:creator>Maigo</dc:creator><author>Maigo</author><pubDate>Sun, 04 Nov 2012 15:46:00 GMT</pubDate><guid>http://www.cppblog.com/mjsz-cppblog/archive/2012/11/04/194177.html#194532</guid><description><![CDATA[用stl挺耗空间的<img src ="http://www.cppblog.com/mjsz-cppblog/aggbug/194532.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/mjsz-cppblog/" target="_blank">Maigo</a> 2012-11-04 23:46 <a href="http://www.cppblog.com/mjsz-cppblog/archive/2012/11/04/194177.html#194532#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>