代码:
#include <iostream>
#include<vector>
using namespace std;
typedef int T; //顶点的值类型 int, char, double and so on
struct Node
{
T value; //顶点值
int numbers; //顶点编号
};
struct Edge
{
int num1; //起始顶点
int num2; //终止顶点
int weight; //边所对应的权值
};
class Graph
{
private:
int vertex_nums; //顶点数
int edge_nums; //边数Ss
vector<Node> vertex; //顶点表,强制设为编号从0开始
vector<Edge> edge; //边表
vector<vector<int> > edge_maze; //邻接矩阵,存储各个顶点连接关系
public:
Graph(int n1=10,