The challenge involves an undirected cyclic graph that represents pairs of connected nodes that have some kind of a relationship between them. The goal is to group all nodes that are connected either directly or indirectly (transitively).
by Itzik Ben-Gan via IT Pro - Microsoft Windows Information, Solutions, Tools
No comments:
Post a Comment