Write a C++ program that will read in the number of nodes (less
than 10) and a adjacency relation representing a graph. The program
will create an adjacency matrix from the adjacency relation. The
program will then print the following items:
1. Print the adjacency matrix
2. Determine if there are any isolated nodes and print them
3. Determine if an Euler path exists
Sample run output
Please input the number of nodes:
6
Please input the adjacency relation:
{(1,2),(1,5),(2,1),(2,3),(3,2),(3,4),(4,3),(4,5),(5,1),(5,4)}...