ad.h

来自「贪婪算法合集,包括二分覆盖,单源最短路径,拓扑排序,机器调度问题」· C头文件 代码 · 共 20 行

// file ad.h
//adjacency matrix representation of a directed graph
//final version

#ifndef AdjacencyDigraph_
#define AdjacencyDigraph_

#include "awd.h"

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

#endif