What do u mean by redundant? If you mean those edges removing which any pair of vertices have same connectivity as before, then DFS will do. Note that you need to traverse all the edges and all the vertices and DFS is linear in these terms so that looks best to me.
On Mar 6, 2:55 am, "Abid" <[EMAIL PROTECTED]> wrote: > I am trying to remove redundant edges in a Direct Acyclic Graph (DAG). > Is their any efficent approach to do it? I am using depth first search > along critical path criteria but its very slow for large graphs. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
