2. For the route planning problem shown in the figure, six cities are labelled as 1-6,...

Transcribed Image Text:

2. For the route planning problem shown in the figure, six cities are labelled as 1-6, and their connectivity and distances are given on the edges in the graph. If we start from city 1 and the destination is city 5, apply the following search algorithms to find a path. Provide details of the node expansion and the found path from start to goal. 1) Breadth-first search 2) Depth-first search 3) Uniform-cost search 14 a 7 2 6 3) 10 11 15 16 2. For the route planning problem shown in the figure, six cities are labelled as 1-6, and their connectivity and distances are given on the edges in the graph. If we start from city 1 and the destination is city 5, apply the following search algorithms to find a path. Provide details of the node expansion and the found path from start to goal. 1) Breadth-first search 2) Depth-first search 3) Uniform-cost search 14 a 7 2 6 3) 10 11 15 16

Answer rating: 100% (QA)

1 Breadth First Search include using namespace stdstruct Edge int source dest weight class Graphpublicvector adjListGraphvector const edges int x int ... View the full answer