Minimum Path Sum Algorithm

A minimal spanning tree (MST) or minimal weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimal possible total edge weight. Currency is an acceptable unit for edge weight – there is no requirement for edge lengths to obey normal rules of geometry such as the triangle inequality.

Minimum Path Sum source code, pseudocode and analysis