I’m studying for my Graphs class and need an explanation.
1.Using the graph in part 1, provide either an Euler path or an Euler circuit.Explain why one exists and the other does not.
2.Using the graph in part 1, find the optimal tour for your graph by applying the Brute Force algorithm.
3. Using the graph in part 1, apply the Nearest Neighbor algorithm with your place of residence as the reference vertex.Is this the optimal tour for your graph? Why or why not.