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.
This approach is overly complicated. Use a simple undirected graph implemented as a directed graph with edges in both directions. Then use standart DFS, and terminate when the vortex has only one neighbour.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Java Visitor Pattern
You are viewing a single comment's thread. Return to all comments →
This approach is overly complicated. Use a simple undirected graph implemented as a directed graph with edges in both directions. Then use standart DFS, and terminate when the vortex has only one neighbour.