back edge is usefull to find a cycle in graph in finding cycle algorithm ( using DFS) we mark every edge as "back edge" or "tree edge" then traverse again total number of back edges give the number of cycle present in directed graph.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
