A feedback edge set of an undirected graph G = (V, E) is a subset of edges E' ⊆ E that...

A feedback edge set of an undirected graph G = (V, E) is a subset of edges E' ⊆ E that intersects every cycle of the graph. Thus, removing the edges E’ will render the graph acyclic.

Give an efficient algorithm for the following problem:

Input: Undirected graph G = (V, E) with positive edge weights we

Output: A feedback edge set E' ⊆ E of minimum total weight