The Edge-

Picking
Algorithm
The Edge- Picking Algorithm
1. Mark the edge of smallest
weight in the graph. (If two or
more edges have the same
weight, pick any one.)
The Edge- Picking Algorithm
2. Mark the edge of the smallest
weight in the graph, as long as it
does not complete a circuit and
does not add a third marked edge
to a single vertex.
The Edge- Picking Algorithm
3. Continue this process until
you can no longer mark any
edges. Then mark the final
edge that completes the
Hamilton circuit.