Preskoči na glavni sadržaj

Sign up for FREE

March 3 Quiz 2 on Graph Theory

Posljednje ažuriranje about 5 years ago

8

15

20

10

10

Pitanje 4

4.

10

15

10

10

Pitanje 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

Pitanje 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

Pitanje 3

3.

Euler Path

Hamilton Path

Hamilton Circuit

Euler Circuit

Pitanje 5

5.

null

null

null

null

Pitanje 6

6.

null

null

null

null

Pitanje 7

7.

Find the weight of edge BF

15

21

18

6

Pitanje 8

8.

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

82

87

65

66