adjacencywdigraph.output

来自「这是数据结构、算法与应用-C++语言描述的代码」· OUTPUT 代码 · 共 30 行

Number of Vertices = 4
Number of Edges = 0

The graph is
Number of Vertices = 4
Number of Edges = 5
0  0  2  4  
3  0  0  1  
0  0  0  0  
0  5  0  0  


The graph after deleting (2,1) is
Number of Vertices = 4
Number of Edges = 4
0  0  2  4  
0  0  0  1  
0  0  0  0  
0  5  0  0  

existsEdge(3,1) = 0
existsEdge(1,3) = 1
inDegree(3) = 1
outDegree(1) = 2
Number of Vertices = 4
Number of Edges = 4

Edges incident to vertex 4
2 5