Find the smallest polygon with a certain edge on a 2d dijkstra graph
Sorry for bad English.
I’m currently working on some algorithm to seperate a graph into rooms. Like the example.
I have a graph link like the one in left, I want to tell there are 2 rooms in the graph, like the red area and the orange area in the right.(https://i.sstatic.net/AJz3FU58.png)