To solve relinets .I tried using the concept that the number of SCC should not increase after removing an edge.If it does then that edge cannot be removed.For this the consideration of edges was done in desc order by edge weight.However it gives incorrect solution.
I then found out that this quesn is based on concp of bridges but i m not able to figure out how to use it.
I am new to graph theory.Can someone help me figure out how to do so
Thanks in advance