【数据结构基础C++】图论07-构造带权图

用一个Edge类描述顶点与边

#pragma once
#include <iostream>
#include <cassert>

using namespace std;

template<typename Weight>

class Edge {
   
private:
	int a, b;
	Weight weight;

public:
	Edge(int a, int b, Weight weight) {
   
		this->a = a;
		this->b = b;
		this->weight = weight;
	}
	Edge() {
   }
	~Edge(){
   }
	int v() {
    return a; }											//返回第一个顶点

	int w() {
    return b; }											//返回第二个顶点

	Weight wt() {
    return weight; }									//返回a-b边的权值

	int other(int x) {
   												//给定一个顶点，返回另一个顶点
		assert(x == a || x == b);
		return x == a ? b : a;						
	}

	friend ostream& operator<<(ostream& os, const Edge& e) {
   		//重载输出运算符
		os << e.a << "-" << e.b << ":" << e.weight;
		return os;
	}

	bool operator<(Edge<Weight>& e) {
   								//当前边的权值是否小于给定e的权值
		return weight < e.wt();
	}

	bool operator<=(Edge<Weight>& e) {
   
		return weight <= e.wt();
	}

	bool operator>(Edge<Weight>& e) {
   
		return weight > e.wt();
	}

	bool operator>=(Edge<Weight>& e) {
   
		return weight >= e.wt();
	}

	bool operator==(Edge<Weight>& e) {
   
		return weight == e.wt();
	}
};

在DenseGraph 和 SparseGraph中加上权值信息

1. DenseGraph

#pragma once
#include <iostream>
#include <vector>
#include <cassert>
#include "Edge.h"

using namespace std;
template<typename Weight>

class DenseGraph {
   
private:
	int n, m;										//v=vertex,e=edge
	vector<vector<Edge<Weight>*>> g;				//邻接矩阵,二维,为什么要用指针？邻接矩阵中不相邻的边用NULL表示
	bool directed;

public:
	DenseGraph(int n, bool directed) {
   
		assert(n >= 0