agraph.h

贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题

// 图的邻接矩阵,也就是固定没有边就=0， 然后权值也是为1

#ifndef AdjacencyGraph_
#define AdjacencyGraph_

#include "awgraph.h"

class AdjacencyGraph : public AdjacencyWGraph<int>
{
public:
	AdjacencyGraph(int Vertices = 10) : AdjacencyWGraph<int>(Vertices, 0) {}
    AdjacencyGraph& Add(int i, int j) {AdjacencyWGraph<int>::Add(i,j,1); return *this;}
	AdjacencyGraph& Delete(int i, int j){AdjacencyWGraph<int>::Delete(i,j);return *this;}
};

#endif