Skip to content

JiaWeiXie/hamiltonian_path

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Find Hamiltonian Path

$ python main.py
           0       1       2       3       4       5       6       7
   0    0.0000  1.5370  1.3894  1.4465  0.4576  0.8363  0.4539  0.8824
   1    1.5370  0.0000  1.4664  1.3408  1.9961  0.8409  0.5910  0.8139
   2    1.3894  1.4664  0.0000  0.5351  0.5019  1.7269  1.8371  0.8510
   3    1.4465  1.3408  0.5351  0.0000  0.7175  0.7361  1.8700  1.7979
   4    0.4576  1.9961  0.5019  0.7175  0.0000  1.2390  1.3912  1.0995
   5    0.8363  0.8409  1.7269  0.7361  1.2390  0.0000  0.7543  1.7874
   6    0.4539  0.5910  1.8371  1.8700  1.3912  0.7543  0.0000  0.6017
   7    0.8824  0.8139  0.8510  1.7979  1.0995  1.7874  0.6017  0.0000

================================================================
Source: 0 Path: [0, 1, 2, 3, 4, 5, 6, 7] Cost: 6.8511
================================================================
Source: 0 Path: [0, 1, 2, 3, 4, 7, 6, 5] Cost: 6.7116
================================================================
Source: 0 Path: [0, 1, 2, 4, 3, 5, 6, 7] Cost: 6.3150
================================================================
Source: 0 Path: [0, 1, 5, 3, 2, 4, 6, 7] Cost: 6.1440
================================================================
Source: 0 Path: [0, 1, 5, 3, 2, 4, 7, 6] Cost: 5.8522
================================================================
Source: 0 Path: [0, 1, 6, 7, 2, 4, 3, 5] Cost: 5.5363
================================================================
Source: 0 Path: [0, 4, 2, 3, 5, 1, 6, 7] Cost: 4.2643
================================================================
Source: 1 Path: [1, 0, 2, 3, 4, 5, 6, 7] Cost: 6.7740
================================================================
Source: 1 Path: [1, 0, 2, 3, 4, 7, 6, 5] Cost: 6.6345
================================================================
Source: 1 Path: [1, 0, 2, 4, 3, 5, 6, 7] Cost: 6.2380
================================================================
Source: 1 Path: [1, 0, 4, 2, 3, 5, 6, 7] Cost: 5.1238
================================================================
Source: 1 Path: [1, 5, 3, 2, 4, 0, 6, 7] Cost: 4.1272
================================================================
Source: 2 Path: [2, 0, 1, 3, 4, 5, 6, 7] Cost: 7.5798
================================================================
Source: 2 Path: [2, 0, 1, 3, 4, 7, 6, 5] Cost: 7.4403
================================================================
Source: 2 Path: [2, 0, 1, 5, 3, 4, 6, 7] Cost: 7.2138
================================================================
Source: 2 Path: [2, 0, 1, 5, 3, 4, 7, 6] Cost: 6.9221
================================================================
Source: 2 Path: [2, 0, 1, 6, 5, 3, 4, 7] Cost: 6.8248
================================================================
Source: 2 Path: [2, 0, 4, 3, 1, 5, 6, 7] Cost: 6.1023
================================================================
Source: 2 Path: [2, 0, 4, 3, 5, 1, 6, 7] Cost: 5.3342
================================================================
Source: 2 Path: [2, 3, 4, 0, 5, 1, 6, 7] Cost: 4.5801
================================================================
Source: 3 Path: [3, 0, 1, 2, 4, 5, 6, 7] Cost: 7.5469
================================================================
Source: 3 Path: [3, 0, 1, 2, 4, 7, 6, 5] Cost: 7.4074
================================================================
Source: 3 Path: [3, 0, 1, 5, 6, 4, 2, 7] Cost: 7.3229
================================================================
Source: 3 Path: [3, 0, 1, 5, 6, 7, 2, 4] Cost: 6.5334
================================================================
Source: 3 Path: [3, 0, 4, 2, 1, 5, 6, 7] Cost: 6.0695
================================================================
Source: 3 Path: [3, 0, 4, 2, 7, 1, 5, 6] Cost: 5.6662
================================================================
Source: 3 Path: [3, 0, 4, 2, 7, 1, 6, 5] Cost: 5.4163
================================================================
Source: 3 Path: [3, 0, 4, 2, 7, 6, 1, 5] Cost: 5.2907
================================================================
Source: 3 Path: [3, 2, 4, 0, 5, 1, 6, 7] Cost: 4.3645
================================================================
Source: 4 Path: [4, 0, 1, 2, 3, 5, 6, 7] Cost: 6.0883
================================================================
Source: 4 Path: [4, 0, 1, 3, 2, 7, 6, 5] Cost: 6.0776
================================================================
Source: 4 Path: [4, 0, 1, 5, 3, 2, 7, 6] Cost: 5.5594
================================================================
Source: 4 Path: [4, 0, 1, 6, 5, 3, 2, 7] Cost: 5.4621
================================================================
Source: 4 Path: [4, 0, 1, 6, 7, 2, 3, 5] Cost: 5.3095
================================================================
Source: 4 Path: [4, 0, 2, 3, 5, 1, 6, 7] Cost: 5.1518
================================================================
Source: 4 Path: [4, 0, 5, 1, 6, 7, 2, 3] Cost: 4.7136
================================================================
Source: 4 Path: [4, 0, 6, 1, 5, 3, 2, 7] Cost: 4.4656
================================================================
Source: 5 Path: [5, 0, 1, 2, 3, 4, 6, 7] Cost: 7.0853
================================================================
Source: 5 Path: [5, 0, 1, 2, 3, 4, 7, 6] Cost: 6.7935
================================================================
Source: 5 Path: [5, 0, 1, 3, 2, 4, 6, 7] Cost: 6.7441
================================================================
Source: 5 Path: [5, 0, 1, 3, 2, 4, 7, 6] Cost: 6.4523
================================================================
Source: 5 Path: [5, 0, 1, 6, 7, 2, 3, 4] Cost: 5.6696
================================================================
Source: 5 Path: [5, 0, 1, 6, 7, 2, 4, 3] Cost: 5.6365
================================================================
Source: 5 Path: [5, 0, 4, 2, 3, 1, 6, 7] Cost: 4.8645
================================================================
Source: 5 Path: [5, 3, 2, 4, 0, 6, 1, 7] Cost: 4.0895
================================================================
Source: 6 Path: [6, 0, 1, 2, 3, 4, 5, 7] Cost: 7.7363
================================================================
Source: 6 Path: [6, 0, 1, 2, 3, 4, 7, 5] Cost: 7.5968
================================================================
Source: 6 Path: [6, 0, 1, 2, 4, 3, 5, 7] Cost: 7.2003
================================================================
Source: 6 Path: [6, 0, 1, 5, 3, 2, 4, 7] Cost: 5.7044
================================================================
Source: 6 Path: [6, 0, 4, 2, 3, 5, 1, 7] Cost: 4.3394
================================================================
Source: 7 Path: [7, 0, 1, 2, 3, 4, 5, 6] Cost: 7.1318
================================================================
Source: 7 Path: [7, 0, 1, 2, 4, 3, 5, 6] Cost: 6.5958
================================================================
Source: 7 Path: [7, 0, 1, 5, 3, 2, 4, 6] Cost: 6.4247
================================================================
Source: 7 Path: [7, 0, 2, 4, 3, 5, 6, 1] Cost: 5.5727
================================================================
Source: 7 Path: [7, 0, 4, 2, 1, 6, 5, 3] Cost: 5.3898
================================================================
Source: 7 Path: [7, 0, 4, 2, 3, 1, 5, 6] Cost: 5.3131
================================================================
Source: 7 Path: [7, 0, 4, 2, 3, 1, 6, 5] Cost: 5.0632
================================================================
Source: 7 Path: [7, 0, 4, 2, 3, 5, 1, 6] Cost: 4.5450
================================================================
Source: 7 Path: [7, 0, 4, 2, 3, 5, 6, 1] Cost: 4.4585
================================================================
Source: 7 Path: [7, 6, 0, 4, 2, 3, 5, 1] Cost: 4.1272
================================================================

{0: [0, 4, 2, 3, 5, 1, 6, 7],
 1: [1, 5, 3, 2, 4, 0, 6, 7],
 2: [2, 3, 4, 0, 5, 1, 6, 7],
 3: [3, 2, 4, 0, 5, 1, 6, 7],
 4: [4, 0, 6, 1, 5, 3, 2, 7],
 5: [5, 3, 2, 4, 0, 6, 1, 7],
 6: [6, 0, 4, 2, 3, 5, 1, 7],
 7: [7, 6, 0, 4, 2, 3, 5, 1]}

About

Complete Graph find Hamiltonian Path

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages