5 ms·
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 t
by Kutta 6y 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.
- evolveyourmind 6y agoThe decreasing number worked, ty. Writing proofs with this will be impossible tho :D