(From Section 24.1) Suppose that for some weighted, directed graph G and some source node s, line 7 of Bellman-Ford is triggered, indicating that since v.d> u.d+ w(u,v) at this point in the algorithm, there is a negative cycle somewhere in G. 3. Draw an example of a graph G for which this occurs, but BELLMAN-FORD(G, w,s) a. INITIALIZE-SINGLE-SOURCE(G,s) neither u nor v is in the negative cycle itself. Specify what order you 3 4
OR
OR