Y
Hacker News
new
|
ask
|
show
|
jobs
by
Kutta
2260 days ago
You need something which decreases on each step. You could try to recurse on the number of unvisited nodes in the graph. You can try well-founded recursion if this does not work for some reason.
1 comments
evolveyourmind
2260 days ago
The decreasing number worked, ty. Writing proofs with this will be impossible tho :D
link