*slowwww* implementation of symmetry matrix

Execution time 14 seconds
symmetry function rename
small improvement
Better attempt, poor results, 17 sec execution time
still rubbish
symmetry yessss

I think I have achieved the same functionality with a simple
modification of the dynamic program for the SUM cost matrix! and when I
add this to the sum matrix performance increases big time, down by an
average of ~5 seconds on the test set
13.71 on test set!
13.54
12.61!!!
12.41
11.56
10.57
Weird contig attempt
not inf > 0.6 on SC, interesting result

There was not enough penalty on the high cost side of the matrix so red
elements were often being selected. This blocks that behaviour. It makes
the contig/symmetry run better but the basic SUM is still just way too
good. Close to giving up. Can still try pre-processing C and using the
standard SUM approach to avoid the current approaches
Symmetry implemented fairly correctly, doesn't seem to help at all
in symmetry multiply the sum by C(t,t), poor result

Elapsed time is 2.330188 seconds.
mean=61.02, median=26.59

ans =

Columns 1 through 5

90.1953   56.5243   48.1979   30.1992   16.3204

Columns 6 through 7

11.4729    5.2926
multiply cost by the normalized cumsum of the incident vector to w

Elapsed time is 2.232981 seconds.
mean=26.47, median=26.89

ans =

Columns 1 through 5

94.5059   64.2421   46.3095   26.5896   17.3374

Columns 6 through 7

9.1978    2.6852
slow implementation of switch-downs
sum of the differences of the sorted values in C, very interesting
essentially taking the median, again looks like it's got potential

(apart from actually working)