From Daan
Jump to: navigation, search
(Created page with " The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here]. Here is the [https://hamiltoncycle.gijsvanhorn.nl/hamiltoniancycled...")
 
Line 3: Line 3:
  
  
Here is the [https://hamiltoncycle.gijsvanhorn.nl/hamiltoniancycledata data from the graphs].
+
Here is the source data from our interactive graphs:
 +
 
 +
Cheeseman's algorithm on 16 nodes graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-results.dsv]
 +
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-derived-results.dsv]
 +
 
 +
Cheeseman's algorithm on 24 node graphs:"https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-results.dsv" 
 +
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-derived-results.dsv"
 +
 
 +
Van Horn's algorithm on 16 node graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Inverse-Cheeseman-results.dsv]
 +
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Inverse-Cheeseman-derived-results.dsv]
 +
 
 +
Van Horn's algorithm on 24 node graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Inverse-Cheeseman-results.dsv]
 +
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Inverse-Cheeseman-derived-results.dsv]
 +
 
 +
Vandegriend and Culberson's algorithm on 16 nodes: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-results.dsv]
 +
Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Pruning-derived-results.dsv]
 +
 
 +
Vandegriend and Culberson's algorithm on 24 nodes [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-results.dsv]
 +
Average and median computational costs [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Pruning-derived-results.dsv]
 +
 
  
  
 
And here is the [https://hamiltoncycle.gijsvanhorn.nl/sourcecode source code] of the algorithms.
 
And here is the [https://hamiltoncycle.gijsvanhorn.nl/sourcecode source code] of the algorithms.

Revision as of 22:56, 5 September 2018

The interactive graphs for Hamiltonian cycles can be found here.


Here is the source data from our interactive graphs:

Cheeseman's algorithm on 16 nodes graphs: [1] Average and median computational costs: [2]

Cheeseman's algorithm on 24 node graphs:"https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-results.dsv" Average and median computational costs: [https://hamiltoncycle.gijsvanhorn.nl/data/24-node-Cheeseman-derived-results.dsv"

Van Horn's algorithm on 16 node graphs: [3] Average and median computational costs: [4]

Van Horn's algorithm on 24 node graphs: [5] Average and median computational costs: [6]

Vandegriend and Culberson's algorithm on 16 nodes: [7] Average and median computational costs: [8]

Vandegriend and Culberson's algorithm on 24 nodes [9] Average and median computational costs [10]


And here is the source code of the algorithms.