popup14 labb 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 19/176 (11%) 7.65 6.47
B Eulerian Path 17/115 (15%) 5.48 5.35
C Maximum Flow 16/113 (14%) 4.71 4.56
D Minimum Cost Maximum Flow 0/3 (0%) 3.00 --
E Minimum Cut 12/33 (36%) 2.06 1.17
F Minimum Spanning Tree 24/145 (17%) 5.58 5.46
G Single source shortest path, non-negative weights 23/111 (21%) 4.44 4.30
H Single source shortest path, time table 20/99 (20%) 4.71 4.65
I Single source shortest path, negative weights 11/141 (8%) 6.71 5.45