Exercise from The Algorithm Design Manual6-10. [4] Let G = (V,E) be an undirected graph. A set F  E of edges  is called a feedback-edge set if every cycle of G has at least one  edge in F. (b) Suppose that G is a weighted undirected graph with  positive edge weights. Design an efficient algorithm to find a  minimum-weight feedback-edge set.My proposed solution for (b) is to run DFS with getting max weight as the tie breaker. Then every back edge will always be the lowest weighted edge in its cycle. I'm wondering if this is a valid solution.
Min weight feedback edge set with DFS?
algorithms