Send your feedback or ask for help here!
I would have set this one to hard (I know, personal opinion) because if you tackle it without prior graph knowledge it can become quite complex. Nice puzzle otherwise, thanks
So from the description I am assuming the graph’s are planar, however no test cases besides the first one seems to follow Euler’s rule. So how do you calculate the number of faces the graph has without using Eulers rule?
I do not want to spoil more here, but I can tell all graphs are planar.
There must be something you are doing wrong (which is probably related to how you handle the oceans…).
And just FYI this problem is solvable without using the rule you mention: comp0zr came up with an elegant BFS/DFS solution to count the faces.
Remember that Euler is for single planes. Consider how continents act as planes, and what the rule actually is counting when you use it.
So I’m able to solve 75% but the last one times out. I think I am using a solution that is probably not great.
I know it has to do with the way I determine how many continents there are. I iterate through the node number list and try find paths to all points. I suppose BFS is more optimal in how it computes paths?
I did solve successfully the puzzle (once I did read the few comment in this discussion, which gave me an clue) and I was willing to compare my solution with other people solution, unfortunately I did write it in swift and nobody did solve the puzzle in swift. I can eventually translate my code in another language ( java or C or C++) which will enable me to access to the code used for this solution,I am just wondering which language was the more used to solve the puzzle …? so that I am sure I will have access to the solution ( especially I’d like to see the BFS/DFS solution that @Fluxor did comment
If you look at the solutions page you can see who / how many shared for languages you haven’t used, just not open them to see the actual code.
Ooops I did miss this menu
Hello, thanks to the help of the comments I learn out about the euler formula. I applied the DFS algorithm to find out the number of connected components and count how many vertices and edges each connected component has. For each connected component I applied the euler formula, subtracting 1 from the result, because the formula counts the external area as a face.
I feel like I missed something here. My solution doesn’t do anything very complex at all, certainly not what I would consider BFS or DFS. I don’t want to give too much away but did anyone else find an alternate solution that is really easy (basically sorting into lists)?
There are two parts in this problem, connected components and number of faces.
I guess you talk about the connected components.
I don’t know, you have to traverse your graph somehow, usually you launch a traversal, BFS or DFS from every non visited vertex, you count how many explorations you actually did and that’s it.
A DFS is something really simple so maybe you do a DFS without realizing.
I don’t know exactly what you sort and how but I suppose you have to iterate on your list at some point and it might just be equivalent to launching traversals in your graph.
There are other methods to find connected components on the fly with union-find (it’s basically building a forest) but it’s not needed here.