From Daan
Jump to: navigation, search
Line 1: Line 1:
 +
 +
==Interative Graphs==
  
 
The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].
 
The interactive graphs for Hamiltonian cycles can be found [https://hamiltoncycle.gijsvanhorn.nl/ here].
  
  
Here is the source data from our interactive graphs:
+
== Source Data for Interative Graphs==
  
 
Cheeseman's algorithm on 16 nodes graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-results.dsv]
 
Cheeseman's algorithm on 16 nodes graphs: [https://hamiltoncycle.gijsvanhorn.nl/data/16-node-Cheeseman-results.dsv]
Line 24: Line 26:
  
  
 +
== Source Code for the algortihms==
  
 
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:57, 5 September 2018

Interative Graphs

The interactive graphs for Hamiltonian cycles can be found here.


Source Data for Interative 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]


Source Code for the algortihms

And here is the source code of the algorithms.