c. In graph traversal, Breadth-first Search (BFS) order is "Level order" in the sense that it explores the neighbour nodes first, before moving to the next level neighbours reachable from the source and its distance. 3 A B 2 E 1 2 3 F G н Figure 2 Perform Dijkstra's algorithm starting from node A. In which order does the algorithm visit the nodes, and what is the computed distance to each of them? There are several possible orders to visit the nodes; choose and show one possible path that can be taken. ii)

No code please and thank you.

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

Operations Research (OR)

Show the steps of the Prim-Jarnik algorithm on the graph below, as done in class, starting with node C. Graph of 4 nodes A 1 3 /4 D F