title: Fastest way to list all edges that form a cycle in a graph if one edge that forms the cycle is known
body: <p>I've been going through algorithms for finding edges that form a cycle in an undirected graph(in particular: <a href="http://www.geeksforgeeks.org/detect-cycle-undirected-graph/" rel="nofollow">http://www.geeksforgeeks.org/detect-cycle-undirected-graph/</a>). What I'm asking though is: are there any fast approaches to finding such a cycle if one edge is already known?(only one such cycle) What I thought of is applying the isCyclicUtil only on the two vertices that form the edge(or maybe only one) and using the visited array to check for the edges that form it. Is there any faster way however of solving this. Anyone got any ideas?</p>