a) Finding shortest path between a source and a destination
b) Travelling Salesman problem
c) Map coloring problem
d) Depth first search traversal on a given map represented as a graph
Answer: b
Explanation: Refer the TSP problem.
Related Posts
How many successors are generated in backtracking search?
When is breadth-first search is optimal?
How many types are available in uninformed search method?
Which search is implemented with an empty first-in-first-out queue?
Which search strategy is also called as blind search?
Which is the best way to go for Game playing problem?
Which search method takes less memory?
Join The Discussion