Description: N vertices in a weighted graph G, a Hamilton circuit is a sequence of vertices v1, v2, • • • • vn where each edge by a vertex vi is connected to vi+1 (i = 1,2, • • • • • , n-1), and vn is connected to v1. In all of the Hamilton circuit, find a right value and the minimum loop, this loop is the minimum Hamilton circuit.
File list (Check if you may need any files):
Hamilton.doc
Download