popup13 labb 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 10/115 (9%) 6.39 7.80
B Eulerian Path 15/40 (38%) 2.50 2.53
C Maximum Flow 21/50 (42%) 2.08 1.76
D Minimum Cost Maximum Flow 1/43 (2%) 10.75 1.00
E Minimum Cut 12/24 (50%) 1.71 1.25
F Minimum Spanning Tree 24/70 (34%) 2.69 2.71
G Single source shortest path, non-negative weights 28/134 (21%) 4.79 4.79
H Single source shortest path, time table 15/49 (31%) 2.88 3.00
I Single source shortest path, negative weights 6/118 (5%) 5.90 2.50