Jump to: navigation, search

Use sliders to set the edge value for a Hamilton Circuit of 5 cities. Select the edges to see the total weight using an algorithm such as Brute Force, Nearest Neighbor, Repetitive Nearest Neighbor and Cheapest Link. Created by Jerel L. Welker

Start with a weighted chart to find the Hamilton Circuit.

Move a point through the interior of a triangle to find a minimum spanning tree. Use in the discovery of the Steiner Point.

Three rays are constructed at 120 degree angles. By positioning the rays over 3 points of a triangle, the Steiner Point is estimated.

back to English