Yes...|E| has to be greater than or equal to |V|, otherwise we know that there cannot be a root node. Then do a simple BFS, since O(|E|)>O(|V|), we can technically call it O(|E|)
--~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
