We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
So, we just need to enumerate connected components of the graph here. It can be done with DFS or BFS. I personally prefer the second (mostly because BFS can be implemented easy without recursion).
Roads and Libraries
You are viewing a single comment's thread. Return to all comments →
C#
So, we just need to enumerate connected components of the graph here. It can be done with DFS or BFS. I personally prefer the second (mostly because BFS can be implemented easy without recursion).