Trgovski potnik

Korak 1: ( |s| = 0 );
g( 2, { } ) = C[2, 1] = 5
g( 3, { } ) = C[3, 1] = 6
g( 4, { } ) = C[4, 1] = 8

Korak 2: ( |s| = 1 );

g( 2, {3} ) = C[2, 3] + g( 3, { } ) = 9 + 6 = 15 J = 3
g( 2, {4} ) = C[2, 4] + g( 4 { } ) = 10 + 8 = 18 J = 4

g( 3, {2} ) = C[3, 2] + g( 2, { } ) = 13 + 5 = 18 J = 2
g( 3, {4} ) = C[3, 4] + g( 4, { } ) = 12 + 8 = 20 J = 4

g( 4, {2} ) = C[4, 2] + g( 2, { } ) = 8 + 5 = 13 J = 2
g( 4, {3} ) = C[4, 3] + g( 3, { } ) = 9 + 6 = 15 J = 3

Korak 3: ( |s| = 2 );

g ( 2 {3, 4} )( = C[2, 3] + g ( 3 {4} ) = 9 + 20 = 29

= C[2, 4] + g ( 4 { 3} ) = 10 + 15 = 25 J = 4 (zapišemo samo tu ker je cenejša)

g (3 {2, 4} ) = C[3, 2] + g ( 2 {4} ) = 13 + 18 = 31

= C[3, 4] + g ( 4 {2} ) = 12 + 13 = 25 J = 4

g (4 {2, 3} ) = C[4, 2] + g ( 2 {3} ) = 8 + 15 = 23 J = 2

= C[4, 3] + g ( 3 {2} ) = 9 + 18 = 27

Korak 4: ( |s| = 3 );
g (1 {2, 3, 4} = C[1,2] + g ( 2 {3, 4} ) = 10 + 25 = 35 J = 2
= C[1,3] + g ( 3 { 2, 4} ) = 15 + 25 = 40
= C [1, 4] + g ( 4 {2, 3} ) = 20 + 23 = 43

// sedaj pa rekonstruiramo rešitev oz. pot

1→ 2 → 4 → 3 → 1