Part -1:
1. Create a scenario for the weighted graph above. Make sure that you have stated what the vertices, edges, and weights represent.
2. Create an algorithm for the shortest and longest path that you can find for the graph above.
3. How much longer is the longest path than the shortest path?
4. Which path will you need for your scenario above?Euler Paths and Circuits
Part -2:
1. Label the degree of each vertex above.
2. Decide if each graph above is an Euler path. If so, provide an algorithm for that path.
3. Decide if each graph above is an Euler Circuit. If so, provide an algorithm for that circuit.