AAPS19 Lab 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 8/83 (10%) 8.30 8.62
B Eulerian Path 2/6 (33%) 2.00 2.50
C Maximum Flow 11/141 (8%) 10.07 11.64
D Minimum Cost Maximum Flow 1/1 (100%) 1.00 1.00
E Minimum Cut 7/17 (41%) 2.43 2.43
F Minimum Spanning Tree 16/76 (21%) 4.22 4.50
G Single source shortest path, non-negative weights 21/145 (14%) 6.90 6.90
H Single source shortest path, time table 15/98 (15%) 6.12 6.40
I Single source shortest path, negative weights 13/147 (9%) 9.80 9.85