Graph Traversal Flashcards
1
Q
What is depth first search
A
This will search all the paths coming from a node and travel until there is a dead end, once a dead end is found and all of nodes have been searched it willl stop
2
Q
What is breadth first search
A
This will search for the neighbouring nodes and will search their paths before moving up, this is costly as there will need to be storage for the nodes that have already been visited
3
Q
What is Best first search
A
This is an improvement on depth first search (dead end) as a huerstic is used to see what node should be explored next
4
Q
What is the time for Exhaustive search ?
A
O((n-1)!)
5
Q
What is exhaustive search ?
A
This is the search that will evaluate all of the paths available
