: Network develop
: 2019-12-07 19:50:51
Description: The adjacency matrix of digraph G is given, which is required to be transformed into adjacency table (using head insertion method to save edges) for storage.
Multiple groups of input data
The first row of each group of data is a positive integer n (0 < n < = 50), representing the number of vertices of G
Next, there are n lines, which are adjacency matrix of digraph G
123.txt, 3594 , 2019-12-07