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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
