adigraph.h
来自「一本全面剖析C++数据结构算法的书籍」· C头文件 代码 · 共 25 行
H
25 行
// file adigraph.h//adjacency matrix representation of a directed graph//initial version#ifndef AdjacencyDigraph_#define AdjacencyDigraph_#include "awdgraph.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
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?