学步园

#include <cstdlib><br /> #include <iostream><br /> #include <fstream><br /> #include <vector><br /> #include <iterator><br /> #include <algorithm><br /> using namespace std;<br /> const int NODE_COUNT = 6;<br /> vector<int> traceVec;<br /> int visit[NODE_COUNT + 1] = {0};<br /> typedef struct _NODE<br /> {<br /> int forward;<br /> int left;<br /> int right;<br /> }NODE;<br /> int getTrace(const NODE *trace, int curPos)<br /> {<br /> if(curPos > -1 && visit[curPos] == 0)<br /> {<br /> if(curPos == 7)<br /> {<br /> traceVec.push_back(curPos);<br /> return 1;<br /> }<br /> else if(getTrace(trace, trace[curPos].left))<br /> {<br /> traceVec.push_back(curPos);<br /> return 1;<br /> }<br /> else if(getTrace(trace, trace[curPos].forward))<br /> {<br /> traceVec.push_back(curPos);<br /> return 1;<br /> }<br /> else if(getTrace(trace, trace[curPos].right))<br /> {<br /> traceVec.push_back(curPos);<br /> return 1;<br /> }</p> <p> visit[curPos] = 1; //如果这个点的三个方向都走过， 则将其置为visited状态<br /> }<br /> return 0;<br /> }<br /> int main(int argc, char *argv[])<br /> {<br /> ifstream input("input.txt");<br /> if(!input)<br /> {<br /> cerr << "Can not open file: " << input << endl;<br /> return -1;<br /> }</p> <p> NODE trace[NODE_COUNT + 1];<br /> int index = 1;</p> <p> while(input >> (trace[index].left))<br /> {<br /> input >> (trace[index].forward);<br /> input >> (trace[index].right);<br /> index++;<br /> }<br /> input.close();<br /> getTrace(trace, 1);</p> <p> reverse(traceVec.begin(), traceVec.end());<br /> if(traceVec.size() > 0)<br /> {<br /> cout << "trace is: " << endl;<br /> ostream_iterator<int> os(cout, " ");<br /> copy(traceVec.begin(), traceVec.end(), os);<br /> cout << endl;<br /> }<br /> else<br /> cout << "no trace" << endl;</p> <p> system("PAUSE");<br /> return EXIT_SUCCESS;<br /> }<br />  

每个点有三个方向， 前， 左， 右...