Sign up for FREE

March 3 Quiz 2 on Graph Theory

Last updated over 4 years ago

8 questions

15

20

10

10

10

15

10

10

Question 1

1.

Using the nearest Neighbor Algorithm, determine the most efficient way to travel all cities starting at city 2 and returning to city 2

Question 2

2.

Using the Cheapest Link Algorithm, determine the most efficient way to travel to all cities starting from city A and ending at city A

Question 3

3.

  Euler Path

  Hamilton Path

  Hamilton Circuit

  Euler Circuit

Question 4

4.

Question 5

5.

Question 6

6.

Question 7

7.

Find the weight of edge BF

15

21

18

6

Question 8

8.

Find the total weight of the Hamilton Circuit; C, G, F, A, B, D, E, C

82

87

65

66