Max: 5.4
Min: 2.1
Average: 3.79
Median: 3.9
 
Comments:
 
A. Some restarted the EPATH algorithm instead of changing the order of the vertices.
 
C. Majority are not aware of the fact that they need to change the weight of the graph. Some used a
negative of p_uv instead of the reciprocal and then applied log, which would create complex numbers.

E.  No one got it completely right.  Some people assumed one can obtain an MST T' from
T by one arc swap.  A few people proved the wrong direction.
 
F. Terrible. At least half do not seem to be aware of which direction they are proving. Usually
they seem to be proving the same direction twice. Many seem not to realize that their proofs used
nothing of the assumptions, which should tip off that something is wrong. 
Few used implicitly the wrong fact that they
can get to another MST just by one swap. For the backward implication, some others claimed that
since, under the assumption, they cannot create another spanning tree using the arc-swap algorithm
starting from the MST T, T must be the unique MST. This is not very accurate since we only know that
the algorithm will generate one MST, but not necessarily all MST in the graph.