lwdgraph.out

一本全面剖析C++数据结构算法的书籍

Edges = 0
The graph is
Vertex 1 = 4 4   3 2   
Vertex 2 = 1 3   4 1   
Vertex 3 = 
Vertex 4 = 2 5   
The graph after deleting <2,1> is
Vertex 1 = 4 4   3 2   
Vertex 2 = 4 1   
Vertex 3 = 
Vertex 4 = 2 5   
Exist(3,1) = 0
InDegree(3) = 1
OutDegree(1) = 2
Edges = 4