Given the undirected graph below, show the sequence of nodes visited when carrying out (i) depth first search and (ii) breadth first search starting from the node “A”. Neighbors are visited in alphabetical order.

3. List the order in which the vertices are visited with a breadth-first search starting with vertex 1. If there are multiple vertices adjacent to a given vertex, visit the adjacent vertex with the lowest value first. 1 8 2 4 6 3 7 9 10

Mark Zuckerberg, the CEO of Facebook, has hired you to lead the Facebook Algorithms Group. He has asked you to use various graph algorithms to analyze the world's largest social network. The Facebook Graph has 2.8 billion vertices, with each vertex being a Facebook user. Two vertices are connected provided those two users are "friends". The first decision you need to make is how you want to model the Facebook graph. Determine whether you should use an adjacency-list representation or an adjacency-matrix representation.

Build the d table for the following graph if you use the breadth first search and start from node s. Remember that we use the alphabetical order rule Assume the blanks/boxes are for the following nodes. Each blank/box is for one node. starting from node r followed by s, t, u, v, w, x, and y, respectively. S t и V W y

We have established a family tree and each node in the family tree is a member. Now we want to find out how many family members are in the family. Please write down the algorithm.

Show what the final distance and previous array values will be after running the shortest path algorithm from class on the following graph, starting at vertex 2: 1 6 5 4 4 4 2 7 0 5 5 6 2 2 3 13 6