The fastest minimum spanning tree algorithm to date was developed by Bernard Chazelle . The algorithm is based on the soft heap , an approximate priority queue . The fastest non-randomized algorithm , by Bernard Chazelle , is based on the soft heap , an approximate priority queue .