Answer Happy

Question 4 : Graphs 10 points For the graph above compute the following: (a) (5 points) Find its adjacency matrix representation of the given graph. Blank spots in your adjacency matrix will be assumed to be 0 so you only need to fill in the 1s. The edges involving A have been filled in for you: A B С D E F G H 0 0 1 0 0 1 0 A B С 0 0 G 0 D 0 0 1 E F G H 0 1 (b) (5 points) Perform a Depth-First Traversal on the given graph starting at A. When there are multiple possible choices of where to go, visit them alphabetically. Label the nodes with the order you visited them in: A B С D E F G H 0 H