Minimum Weight Triangulation

version 1.0.1

/* Initialize */
for i := 1 to n-1 do L[i,i+1] = 0
/* Calculate L[...] and S[...]:
for l := 2 to n-1 do od
    for i := 1 to n-l do
        j := i+l
        L[i,j] = infinity
        if(isValidEdge(i,j))
            for k := i+1 to j-1 do
                x := L[i,k] + L[k,j] + Circumference(i,j,k)
                if x < L[i,j] then
                    L[i,j] := x
                    S[i,j] := k
            od
        fi

    od
od