Twa kɔ nsɛm atitiriw so

Sign up for FREE

March 3 Quiz 2 on Graph Theory

Last updated about 5 years ago

8 Nsɛmmisa

15

20

10

10

Asemmisa {{asɛmmisaAhyɛnsode}}

4.

10

15

10

10

Asemmisa {{asɛmmisaAhyɛnsode}}

1.

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

Asemmisa {{asɛmmisaAhyɛnsode}}

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

Asemmisa {{asɛmmisaAhyɛnsode}}

3.

Euler Path

Hamilton Path

Hamilton Circuit

Euler Circuit

Asemmisa {{asɛmmisaAhyɛnsode}}

5.

null

null

null

null

Asemmisa {{asɛmmisaAhyɛnsode}}

6.

null

null

null

null

Asemmisa {{asɛmmisaAhyɛnsode}}

7.

Find the weight of edge BF

15

21

18

6

Asemmisa {{asɛmmisaAhyɛnsode}}

8.

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

82

87

65

66