I have attached the screenshot of the ass below for the graph!!
Question 1 (25 pts):
Figure 1 Graphs for Question 1.
a. In Figure 1(a), determine if the graph is simple. Also determine if there is a cycle in this graph.
b. In Figure 1(a), determine if the vertices 3 and 9 are connected. If these vertices are connected, find a path from vertex 3 to vertex 9.
c. In Figure 1(b), determine if the vertices 1 and 4 are connected. If these vertices are connected, find a path from vertex 1 to vertex 10.
d. In Figure 1(b), find a path, if any, from vertex 1 to vertex 7that has 4 edges.
Question 2 (25 pts):
Figure 2 A graph for Question 2.
a. Find the adjacency matrix of the graph in Figure 2.
b. Draw the adjacency list of the graph in Figure 2.
c. List the nodes of the graph, in Figure 2, in a depth first traversal.
d. List the nodes of the graph, in Figure 2, in a breadth first traversal.
Question 3 (25 pts):
Figure 3 A graph for Question 3
a. List the nodes of the graph, in Figure 3, in a breadth first traversal.
b. List the nodes of the graph, in Figure3, in a depth first traversal.
Question 4:
Write a program that outputs the nodes of a graph in a breadth first traversal.
Submit the source code, and copy and paste the screenshot of the output here.
