Assignment $1$

Programming and Written Assignment: Uninformed and Informed Search TASK $1(75$ points$)$

Figure $1$: Visual representation of input$1.$txt

Implement a search algorithm that can fin $q,q,q,q,q,q,q,q,$ FILE input$1.$txt IS JUST AN EXAMPLE,

FORMATTED AS SPECIFIED ABOVE. $q,q,q,$

Nodes Popped: $12$

Nodes Expanded: $6$

Nodes Generated: $20$

Distance: $297\mathrm{.}0$ km

Noute:

Breme:

Hannover to Hannover, $132\mathrm{.}0$ km

Hassel, $165\mathrm{.}0$ km

and $q,q,$

should have the following output:

Nodes Popped: $7$

Nodes Expanded:

Nodes Expanded:

Nodes Generated

Distance: Infinity

Route:

None $q,q,q,q,q,q,q,q,$

should have the following output:

Nodes Popped: $3$

Nodes Expanded:

Nodes Generated: $8$

Distance: $297\mathrm{.}0$ km

Route:

Bremen to Hannover, $132\mathrm{.}0$ km

Hannover to Kassel, $165\mathrm{.}0$ km

uggestions $q,q,q,$

Grading $q,q,q,q,q,q,q,q,q,q,$ showhow