Consider the recursive algorithm in Figure 10.80 for finding the shortest weightedpath
Chapter 10, Problem 10.61(choose chapter or problem)
Consider the recursive algorithm in Figure 10.80 for finding the shortest weightedpath in an acyclic graph, from s to t.Distance shortest( s, t ){Distance dt, tmp;if( s == t )return 0;dt = ;for each Vertex v adjacent to s{tmp = shortest(v, t );if( cs,v + tmp < dt)dt = cs,v + tmp;}return dt;a. Why does this algorithm not work for general graphs?b. Prove that this algorithm terminates for acyclic graphs.c. What is the worst-case running time of the algorithm?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer