Problem Statement Problem Statement

As a part of 'Animals Day' a field trip to Zoo is organized for all the preschool kids of that school. Once they reached the Zoo premises, they saw the Zoo Route Map of all the varieties of Animals, Reptiles' Zone, Bears' House, Canine area, National Museum, Safari Region, Bird's section, Food courts and Ticket Counter section etc.

Now guide them in choosing the shortest route by suggesting the best possible path so that they can visit all areas in the zoo. The following graph contains $"n"$ nodes, and various undirected and weighted edges. Consider this as the representation of the Zoo areas$/$zones and its paths between them.

Requirements:

Formulate an efficient algorithm to perform the above task using the Greedy Method.

Provide a description about the design used and the rationale behind the design choice.

Analyze the time complexity of the algorithm.

Implement the above problem statement using Python $3\mathrm{.}7$ and above.

As a part of $$Animals Day$$ a field trip to Zoo is organized for all the preschool kids of that

school. Once they reached the Zoo premises, they saw the Zoo Route Map of all the

varieties of Animals, Reptiles$$ Zone, Bears$$ House, Canine area, National Museum, Safari

Region, Bird$$s section, Food courts and Ticket Counter section etc.

Now guide them in choosing the shortest route by suggesting the best possible path so that

they can visit all areas in the zoo. The following graph contains $$n$$ nodes, and various

undirected and weighted edges. Consider this as the representation of the Zoo areas$/$zones

and its paths between them.

Requirements:

$1.$ Formulate an efficient algorithm to perform the above task using the Greedy

Method.

$2.$ Provide a description about the design used and the rationale behind the design

choice.

$3.$ Analyze the time complexity of the algorithm.

$4.$ Implement the above problem statement using Python $3\mathrm{.}7$ and above.