3 ms·
They are not NP at all. A perfect maze (with one solution) as a connectivity graph is a tree. Finding the path through a tree can be done by DFS in linear O(N)
by xmcqdpt2 4y ago
They are not NP at all. A perfect maze (with one solution) as a connectivity graph is a tree. Finding the path through a tree can be done by DFS in linear O(N) time.
- brokensegue 4y agoall P problems are in NP \pedantic