Perform Breadth-First Search (BFS) starting from node A. List the order in which nodes are visited.

Draw a graph from the adjacency list: adj (y) = [x], adj (x) = [z], adj (z) = [y, w], adj (w) = [x], adj (s) = [z, w], adj (v) = [s, w], adj (t) = [u, v], adj (u) = [v].

Define Relaxation. Run the Bellman-Ford algorithm on the directed graph of the figure, using vertex "s" as the source. In each pass, relax edges in the same order as in the figure, and show the d and fl values after each pass. Now, change the weight of edge .(z,x) to 4 and run the algorithm again, using s as the source.

Consider the foiling weighted and undirected graph to find the path from A to every other vertexs using Dijkstra's algorithm.

What do you mean by flow network and residual network? Use the Ford-Fulkerson Algorithm to find a flow function that maximizes the flow in the below network having the capacities shown and calculate the total flow that results. List the augmenting paths that you use to get your solution in order to get full credit.

Consider the given weighted graph. i. Run Prim's algorithm starting from vertex A. Write the edges in the order which they are added to the minimum spanning tree. ii. Run Kruskal's algorithm starting from vertex A. Write the edges in the order which they are added to the minimum spanning tree.

Run the following All-Pair-Shortest-Paths algorithms on the weighted and directed graph. i. EXTEND-SHORTEST-PATHS algorithm ii. Floyd-Warshall algorithm