10 tests Graphs

I Adjacency list representation.

           The adjacency list file consists of n+1 lines, where n is the number of vertices in the graph. The first line of the data
           file contains the number of vertices. The second through (n+1)st  lines contain the adjacency  list itself.
           The format of the file is very simple: the ith line of the file contains the integer values of the vertices that are
           adjacent to vertex i-1. The values on each line are separated by a single space. If the (i-1)th vertex is not connected
           to any higher valued vertices, then the ith line in the file will be blank.
           The adjacency list we use is packed: duplicates are not shown. For example, if vertex 4 is adjacent to vertex 6, then the
           the fifth line of the file will contain a 6 but the seventh line will not contain the 4. Below are the list of the 10 benchmarks for
           the adjacency list representation.(shift+left click will download the file.)

         test1, test2, test3, test4, test5, test6, test7, test8, test9, test10
 

II Adjacency matrix representation.

         The adjacency matrix consists of a single integer n, (the number of vertices) on the first line, followed by an n x n
         adjacency matrix. A 1 in the i,j position in the matrix means that the vertex i is adjacent to vertex j in the graph. A 0 in the
         i,j position means that vertex i is not adjacent to vertex j.

         test1, test2, test3, test4, test5, test6, test7, test8, test9, test10