awdgraph.out

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

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