Reference no: EM13161771

Graph algorithm.
a. Draw a depth-first search tree based on a given graph. Assume that adjacent vertices are visited in alphabetical order. Then compute the Num and Low values for each vertex, and find out the articulation points if any.
b. Construct a minimum spanning tree, using the Prim or Kruskal algorithm. Fill/update the (Known, dv, pv) or the (weight, action) table step by step.
c. Find the single-source shortest paths for a vertex in a given graph. According to Dijkstra's algorithm, fill/update the (know, dv, pv) table step by step, then indicate the shortest paths according to the final table.