Description: 2. Using adjacency matrix represents a directed graph G, G wrote an algorithm to determine whether there is a leak (ie, the degree of n-1, a degree of a vertex is 0), the requirements of the algorithm time complexity is o (n2).
To Search:
File list (Check if you may need any files):
G.txt
Download