C++

The program you write for this lab will read in the number of nodes and a binary relation representing a graph. The adjacency relation MUST be entered as a list of ordered pairs with commas as separators. The program will create an adjacency matrix from the binary relation and print it. It will then generate the reachability matrix using Warshall's algorithm and print it. NO POINTERS, STRUCTS, OR CLASSES! For example:

Please input the number of nodes: 6 Please input the adjacency relation: {(1,2),(2,3),(3,4),(4,5),(5,1)} The adjacency matrix is: 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 The reachability matrix is: 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 0 0 0 0 0 0 0