Reload
Automatic versionMinimum spanning treeNetwork minimum spanning treeWeighted network minimum spanning tree
Steiner tree problem's heauristic algorithm
Click versionMinimum spanning treeNetwork minimum spanning tree-
Steiner tree problem's heauristic algorithm
Screensaver
Weighted network minimum spanning tree problem(Open 6/Sep/2000 : The 2nd Revision Thursday, 03-Jun-2010 22:18:13 JST)
White is weighted minimum spanning tree, red is Delaunay Tessellations and pink is the weight of edge.
Java(wmst.java)

If you have a message, don't hesitate to send it by using
E-mail:Mail Form
or
BBS

Use of Takashi Ohyama's website
English Home of Takashi Ohyama
Japanese Home of Takashi Ohyama