Discrete

From GeoGebraWiki

• 5 Cities Traveling Salesperson - GGB

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

• Weighted Graph - 6 Vertices - GGB

Start with a weighted chart to find the Hamilton Circuit.

• Flash Video Lessons - Constructing a Steiner Point using Torricelli's Method Part 1 - Part 2 - Part 3 - Part 4 - Part 5 - Part 6 - Lesson Handout The lesson handout also refers to the Junction Point and Steiner Point overlay sheets listed below.

• Junction Point in a Triangle - GGB

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

• Use an overlay of 120 degree rays to determine the Steiner Point - GGB

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

• Find a minimum spanning tree from 4 vertices using up to 2 junction points - GGB

back to English