Google Interview Question
SDE1sCountry: India
Interview Type: Written Test
I cannot think why you would use iterative deepening to solve this question.
Since all the node have to be connected you must search atleast n nodes deep.
If you start of with a connected graph and attempt to iterativley improve up to some number k, this seems more like a local search problem. Maybe I am missing something, if someone can tell me why you would use iterative depth first search for this problem please comment.
Yes, but wouldn't edge swaping be categorized as an iterative local search rather than iterative deepening? Perhaps I just have my terminology wrong.
Google, SDE1, written test, stupid question?
- Anonymous August 24, 2014I don't believe you.