popup17 lab 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 15/114 (13%) 6.71 5.87
B Eulerian Path 16/97 (16%) 6.06 6.06
C Maximum Flow 10/95 (11%) 4.13 3.60
D Minimum Cost Maximum Flow 2/60 (3%) 12.00 1.00
E Minimum Cut 6/39 (15%) 4.88 4.17
F Minimum Spanning Tree 18/100 (18%) 5.00 4.50
G Single source shortest path, non-negative weights 20/105 (19%) 4.77 5.10
H Single source shortest path, time table 18/91 (20%) 5.06 5.06
I Single source shortest path, negative weights 14/121 (12%) 7.12 6.71