adjacencywgraph.output

datastucutre and algorithms, application, in C

Number of Vertices = 4
Number of Edges = 0

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


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

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

Edges incident to vertex 4
1 4
2 5