Tag Archives: traveling salesman

Travelling city problem using depth first search

We know travelling salesman problem is a fully observable, static and deterministic problem. It can be solved by depth first search approach. Depth first search has an advantage that it uses limited amount of memory. But the disadvantage is that … Continue reading

Posted in Searching | Tagged , | Leave a comment