popuph11 labb 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 8/68 (12%) 5.23 5.62
B Eulerian Path 4/34 (12%) 5.67 3.50
C Maximum Flow 3/28 (11%) 2.55 1.00
D Minimum Cost Maximum Flow 0/6 (0%) 6.00 --
E Minimum Cut 2/14 (14%) 1.56 1.00
F Minimum Spanning Tree 10/93 (11%) 7.15 6.20
G Single source shortest path, non-negative weights 19/127 (15%) 6.05 6.58
H Single source shortest path, time table 13/38 (34%) 2.71 2.85
I Single source shortest path, negative weights 3/125 (2%) 8.93 1.33