popup09 labb 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 12/139 (9%) 7.32 7.42
B Eulerian Path 10/73 (14%) 6.08 4.20
C Maximum Flow 2/83 (2%) 5.19 1.00
D Minimum Cost Maximum Flow 2/30 (7%) 7.50 1.00
E Minimum Cut 2/40 (5%) 3.08 1.00
F Minimum Spanning Tree 15/89 (17%) 5.24 5.40
G Single source shortest path, non-negative weights 28/102 (27%) 3.52 3.61
H Single source shortest path, time table 18/60 (30%) 3.16 2.89
I Single source shortest path, negative weights 15/197 (8%) 8.57 5.07