建立图(邻接矩阵、邻近表任选其一)的存储结构、实现图的深度优先遍历和广度优先遍历。 #include <iostream> #include <stdlib.h> using namespace std; const int DefaultVertices=100; const int maxWeight=1000; typedef int E; typedef char T; class Graphmtx{ private: T *VerticesList; E **Edge; int ...