AAPS17 Lab 2

Problems

Name Solved / Tries Average tries Average tries to solve
A All Pairs Shortest Path 4/36 (11%) 7.20 7.75
B Eulerian Path 3/18 (17%) 3.60 4.00
C Maximum Flow 5/75 (7%) 8.33 11.40
D Minimum Cost Maximum Flow 1/1 (100%) 1.00 1.00
E Minimum Cut 4/7 (57%) 1.17 1.00
F Minimum Spanning Tree 7/39 (18%) 4.33 2.86
G Single source shortest path, non-negative weights 11/71 (15%) 5.92 5.82
H Single source shortest path, time table 5/37 (14%) 5.29 4.60
I Single source shortest path, negative weights 5/27 (19%) 3.38 4.60