﻿<?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++博客-lgj-7758</title><link>http://www.cppblog.com/lgj-7758/</link><description /><language>zh-cn</language><lastBuildDate>Tue, 09 Jun 2026 23:20:19 GMT</lastBuildDate><pubDate>Tue, 09 Jun 2026 23:20:19 GMT</pubDate><ttl>60</ttl><item><title>迷宫问题--迷宫路径的探索（用指针来实现）</title><link>http://www.cppblog.com/lgj-7758/archive/2008/12/02/lgjfly.html</link><dc:creator>Gaojingluo</dc:creator><author>Gaojingluo</author><pubDate>Tue, 02 Dec 2008 01:22:00 GMT</pubDate><guid>http://www.cppblog.com/lgj-7758/archive/2008/12/02/lgjfly.html</guid><wfw:comment>http://www.cppblog.com/lgj-7758/comments/68343.html</wfw:comment><comments>http://www.cppblog.com/lgj-7758/archive/2008/12/02/lgjfly.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/lgj-7758/comments/commentRss/68343.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/lgj-7758/services/trackbacks/68343.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: #include&nbsp;&lt;iostream&gt;using&nbsp;namespace&nbsp;std;#define&nbsp;GRID_NUM&nbsp;11&nbsp;&nbsp;&nbsp;&nbsp;//迷宫格子数//利用矩阵来存储迷宫地图//0表示墙，1表示路//探索到的死路将被赋为-1int&nbsp;map[GRID_NUM][GRID_NUM]={&nbsp;&n...&nbsp;&nbsp;<a href='http://www.cppblog.com/lgj-7758/archive/2008/12/02/lgjfly.html'>阅读全文</a><img src ="http://www.cppblog.com/lgj-7758/aggbug/68343.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/lgj-7758/" target="_blank">Gaojingluo</a> 2008-12-02 09:22 <a href="http://www.cppblog.com/lgj-7758/archive/2008/12/02/lgjfly.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>