popup16 lab 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 20/187 (11%) 8.50 8.75
B Eulerian Path 17/159 (11%) 7.57 8.41
C Maximum Flow 22/133 (17%) 4.93 4.36
D Minimum Cost Maximum Flow 5/89 (6%) 6.36 5.40
E Minimum Cut 16/31 (52%) 1.94 1.94
F Minimum Spanning Tree 24/143 (17%) 5.50 5.79
G Single source shortest path, non-negative weights 27/178 (15%) 6.59 6.59
H Single source shortest path, time table 22/81 (27%) 3.68 3.68
I Single source shortest path, negative weights 20/168 (12%) 7.64 7.30