摘要： http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=480图深度遍历水题, 千万别忘记visited标志位的重置. 1 #include 2 #include 3 using namespace std; 4 5 int gn = 0; 6 int gm = 0; 7 int longest = 0; 8 #define MAX_N 26 9 10 typedef struct _graph {11 int nv;12 int ne; 阅读全文