Several algorithms for the minimum spanning tree are known. The Blue-red algorithm is a generic algorithm in this field. A new proof for this algorithm is presented, based upon the duality of circuits and cuts in a graph.
The Blue-red algorithm is genetic, because the other algorithms can be regarded as special instances. This is shown using the same duality
