linkeddigraph.output

来自「datastucutre and algorithms, application」· OUTPUT 代码 · 共 30 行

Number of Vertices = 4
Number of Edges = 0

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

2  


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

2  

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

Vertices adjacenct to vertex 4
2