hello. I've been cracking my head on a question from a test and i'm still not sure how to solve this.
Quesion: Given G = (V, E) , a directed graph. a vetex u is called a root iff there's a path from it to all the other vertices in G Suggest an algorithm that checks whenever vertex u is a root: runtime: O(E) , so i simple BFS o DFS won't work. Thanks for your help guys. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
