How do I solve the second part, Alternating paths redux, using Dijkstra's algorithm. Please note that G is not acyclic.

Alternating paths. Let G- (V, E) be a directed graph. Suppose every node u has a color clv], which is either black or white. Let k be a positive integer. A path in G is called k-alternating if it changes color at least k times. Note that such a path need not be simple (that is, it may contain repeated nodes). For example, consider the following graph: 13 The path A C-B D+E is a 3-alternating path. The path AC-B-+D 5-alternating path E- C B is a Alternating paths, redux. Consider again the Alternating Paths problem from the last problem set. In this problem, you are given a graph G-(V, E) (in adjacency list representation), a color vector c, and a positive integer k. You are to determine if the graph contains a k-alternating path, and if so, to find a k-alternating path with a minimum number of black nodes. Your algorithm should run in time Ok IV+E)) Hint: solve this by reduction to a standard single-source shortest path problem Alternating paths. Let G- (V, E) be a directed graph. Suppose every node u has a color clv], which is either black or white. Let k be a positive integer. A path in G is called k-alternating if it changes color at least k times. Note that such a path need not be simple (that is, it may contain repeated nodes). For example, consider the following graph: 13 The path A C-B D+E is a 3-alternating path. The path AC-B-+D 5-alternating path E- C B is a Alternating paths, redux. Consider again the Alternating Paths problem from the last problem set. In this problem, you are given a graph G-(V, E) (in adjacency list representation), a color vector c, and a positive integer k. You are to determine if the graph contains a k-alternating path, and if so, to find a k-alternating path with a minimum number of black nodes. Your algorithm should run in time Ok IV+E)) Hint: solve this by reduction to a standard single-source shortest path