example ? link to the actual problem ? On Mon, Sep 19, 2011 at 7:44 PM, Sangeeta <sangeeta15...@gmail.com> wrote:
> A graph is given : > > nodes denoting computers > edges denoting connections > > if one system(node) fails , the other systems(node) may get affected. > To identify all the affected nodes, which data structure is used? How > do u implement it? > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
