popup07 labb 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 13/171 (8%) 10.69 7.77
B Eulerian Path 16/70 (23%) 4.12 4.25
C Maximum Flow 2/96 (2%) 6.00 5.00
D Minimum Cost Maximum Flow 1/21 (5%) 5.25 6.00
E Minimum Cut 2/24 (8%) 1.60 1.50
F Minimum Spanning Tree 21/101 (21%) 4.39 4.52
G Single source shortest path, non-negative weights 24/135 (18%) 5.62 5.62
H Single source shortest path, time table 18/58 (31%) 3.05 2.89
I Single source shortest path, negative weights 9/118 (8%) 6.94 5.78