File name? > flowtest1.txt val = 2147483647 0 0 0 0 intree = 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 8 dad[2] = 1 New max is now 2 val[3] = 10 dad[3] = 1 New max is now 3 val = 2147483647 8 10 0 0 intree = 1 0 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 2 val[4] = 5 dad[4] = 3 val[5] = 6 dad[5] = 3 val = 2147483647 8 10 5 6 intree = 1 0 1 0 0 k (next vertex added) = 2 Updating neighbors of 2 New max is now 4 New max is now 5 Flow augmented by 6 Path (starting at sink) = 5, 3, 1, 1 2 3 4 5 -------------------------------------------------- ( 0, 0) ( 8, 0) ( 10, 6) ( 0, 0) ( 0, 0) ( -8, 0) ( 0, 0) ( 0, 0) ( 4, 0) ( 0, 0) (-10, -6) ( 0, 0) ( 0, 0) ( 5, 0) ( 6, 6) ( 0, 0) ( -4, 0) ( -5, 0) ( 0, 0) ( 10, 0) ( 0, 0) ( 0, 0) ( -6, -6) (-10, 0) ( 0, 0) val = 2147483647 0 0 0 0 intree = 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 8 dad[2] = 1 New max is now 2 val[3] = 4 dad[3] = 1 val = 2147483647 8 4 0 0 intree = 1 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 New max is now 3 val[4] = 4 dad[4] = 2 val = 2147483647 8 4 4 0 intree = 1 1 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 4 val = 2147483647 8 4 4 0 intree = 1 1 1 0 0 k (next vertex added) = 4 Updating neighbors of 4 val[5] = 4 dad[5] = 4 New max is now 5 Flow augmented by 4 Path (starting at sink) = 5, 4, 2, 1, 1 2 3 4 5 -------------------------------------------------- ( 0, 0) ( 8, 4) ( 10, 6) ( 0, 0) ( 0, 0) ( -8, -4) ( 0, 0) ( 0, 0) ( 4, 4) ( 0, 0) (-10, -6) ( 0, 0) ( 0, 0) ( 5, 0) ( 6, 6) ( 0, 0) ( -4, -4) ( -5, 0) ( 0, 0) ( 10, 4) ( 0, 0) ( 0, 0) ( -6, -6) (-10, -4) ( 0, 0) val = 2147483647 0 0 0 0 intree = 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 4 dad[2] = 1 New max is now 2 val[3] = 4 dad[3] = 1 val = 2147483647 4 4 0 0 intree = 1 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 New max is now 3 val = 2147483647 4 4 0 0 intree = 1 1 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 val[4] = 4 dad[4] = 3 New max is now 4 val = 2147483647 4 4 4 0 intree = 1 1 1 0 0 k (next vertex added) = 4 Updating neighbors of 4 val[5] = 4 dad[5] = 4 New max is now 5 Flow augmented by 4 Path (starting at sink) = 5, 4, 3, 1, 1 2 3 4 5 -------------------------------------------------- ( 0, 0) ( 8, 4) ( 10, 10) ( 0, 0) ( 0, 0) ( -8, -4) ( 0, 0) ( 0, 0) ( 4, 4) ( 0, 0) (-10,-10) ( 0, 0) ( 0, 0) ( 5, 4) ( 6, 6) ( 0, 0) ( -4, -4) ( -5, -4) ( 0, 0) ( 10, 8) ( 0, 0) ( 0, 0) ( -6, -6) (-10, -8) ( 0, 0) val = 2147483647 0 0 0 0 intree = 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 4 dad[2] = 1 New max is now 2 val = 2147483647 4 0 0 0 intree = 1 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 After 3 augmentations, the Max Flow result is: 14 ------------------------------------------------------------------------------ File name? > flowtest2.txt val = 2147483647 0 0 0 intree = 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 10 dad[2] = 1 New max is now 2 val[3] = 5 dad[3] = 1 val = 2147483647 10 5 0 intree = 1 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 val[3] = 10 dad[3] = 2 New max is now 3 val[4] = 5 dad[4] = 2 val = 2147483647 10 10 5 intree = 1 1 0 0 k (next vertex added) = 3 Updating neighbors of 3 val[4] = 10 dad[4] = 3 New max is now 4 Flow augmented by 10 Path (starting at sink) = 4, 3, 2, 1, 1 2 3 4 ---------------------------------------- ( 0, 0) ( 10, 10) ( 5, 0) ( 0, 0) (-10,-10) ( 0, 0) ( 10, 10) ( 5, 0) ( -5, 0) (-10,-10) ( 0, 0) ( 10, 10) ( 0, 0) ( -5, 0) (-10,-10) ( 0, 0) val = 2147483647 0 0 0 intree = 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[3] = 5 dad[3] = 1 New max is now 3 val = 2147483647 0 5 0 intree = 1 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 val[2] = 5 dad[2] = 3 New max is now 2 val = 2147483647 5 5 0 intree = 1 0 1 0 k (next vertex added) = 2 Updating neighbors of 2 val[4] = 5 dad[4] = 2 New max is now 4 Flow augmented by 5 Path (starting at sink) = 4, 2, 3, 1, 1 2 3 4 ---------------------------------------- ( 0, 0) ( 10, 10) ( 5, 5) ( 0, 0) (-10,-10) ( 0, 0) ( 10, 5) ( 5, 5) ( -5, -5) (-10, -5) ( 0, 0) ( 10, 10) ( 0, 0) ( -5, -5) (-10,-10) ( 0, 0) val = 2147483647 0 0 0 intree = 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 After 2 augmentations, the Max Flow result is: 15 ------------------------------------------------------------------------------ File name? > flowtest3.txt val = 2147483647 0 0 0 0 0 intree = 0 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 15 dad[2] = 1 New max is now 2 val[3] = 20 dad[3] = 1 New max is now 3 val = 2147483647 15 20 0 0 0 intree = 1 0 0 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 2 val[4] = 7 dad[4] = 3 val[5] = 10 dad[5] = 3 val = 2147483647 15 20 7 10 0 intree = 1 0 1 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 New max is now 4 New max is now 5 val = 2147483647 15 20 7 10 0 intree = 1 1 1 0 0 0 k (next vertex added) = 5 Updating neighbors of 5 New max is now 4 val[6] = 6 dad[6] = 5 val = 2147483647 15 20 7 10 6 intree = 1 1 1 0 1 0 k (next vertex added) = 4 Updating neighbors of 4 val[6] = 7 dad[6] = 4 New max is now 6 Flow augmented by 7 Path (starting at sink) = 6, 4, 3, 1, 1 2 3 4 5 6 ------------------------------------------------------------ ( 0, 0) ( 15, 0) ( 20, 7) ( 0, 0) ( 0, 0) ( 0, 0) (-15, 0) ( 0, 0) ( 9, 0) ( 5, 0) ( 8, 0) ( 0, 0) (-20, -7) ( -9, 0) ( 0, 0) ( 7, 7) ( 10, 0) ( 0, 0) ( 0, 0) ( -5, 0) ( -7, -7) ( 0, 0) ( 0, 0) ( 22, 7) ( 0, 0) ( -8, 0) (-10, 0) ( 0, 0) ( 0, 0) ( 6, 0) ( 0, 0) ( 0, 0) ( 0, 0) (-22, -7) ( -6, 0) ( 0, 0) val = 2147483647 0 0 0 0 0 intree = 0 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 15 dad[2] = 1 New max is now 2 val[3] = 13 dad[3] = 1 val = 2147483647 15 13 0 0 0 intree = 1 0 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 New max is now 3 val[4] = 5 dad[4] = 2 val[5] = 8 dad[5] = 2 val = 2147483647 15 13 5 8 0 intree = 1 1 0 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 4 val[5] = 10 dad[5] = 3 New max is now 5 val = 2147483647 15 13 5 10 0 intree = 1 1 1 0 0 0 k (next vertex added) = 5 Updating neighbors of 5 New max is now 4 val[6] = 6 dad[6] = 5 New max is now 6 Flow augmented by 6 Path (starting at sink) = 6, 5, 3, 1, 1 2 3 4 5 6 ------------------------------------------------------------ ( 0, 0) ( 15, 0) ( 20, 13) ( 0, 0) ( 0, 0) ( 0, 0) (-15, 0) ( 0, 0) ( 9, 0) ( 5, 0) ( 8, 0) ( 0, 0) (-20,-13) ( -9, 0) ( 0, 0) ( 7, 7) ( 10, 6) ( 0, 0) ( 0, 0) ( -5, 0) ( -7, -7) ( 0, 0) ( 0, 0) ( 22, 7) ( 0, 0) ( -8, 0) (-10, -6) ( 0, 0) ( 0, 0) ( 6, 6) ( 0, 0) ( 0, 0) ( 0, 0) (-22, -7) ( -6, -6) ( 0, 0) val = 2147483647 0 0 0 0 0 intree = 0 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 15 dad[2] = 1 New max is now 2 val[3] = 7 dad[3] = 1 val = 2147483647 15 7 0 0 0 intree = 1 0 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 val[3] = 9 dad[3] = 2 New max is now 3 val[4] = 5 dad[4] = 2 val[5] = 8 dad[5] = 2 val = 2147483647 15 9 5 8 0 intree = 1 1 0 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 4 New max is now 5 val = 2147483647 15 9 5 8 0 intree = 1 1 1 0 0 0 k (next vertex added) = 5 Updating neighbors of 5 New max is now 4 val = 2147483647 15 9 5 8 0 intree = 1 1 1 0 1 0 k (next vertex added) = 4 Updating neighbors of 4 val[6] = 5 dad[6] = 4 New max is now 6 Flow augmented by 5 Path (starting at sink) = 6, 4, 2, 1, 1 2 3 4 5 6 ------------------------------------------------------------ ( 0, 0) ( 15, 5) ( 20, 13) ( 0, 0) ( 0, 0) ( 0, 0) (-15, -5) ( 0, 0) ( 9, 0) ( 5, 5) ( 8, 0) ( 0, 0) (-20,-13) ( -9, 0) ( 0, 0) ( 7, 7) ( 10, 6) ( 0, 0) ( 0, 0) ( -5, -5) ( -7, -7) ( 0, 0) ( 0, 0) ( 22, 12) ( 0, 0) ( -8, 0) (-10, -6) ( 0, 0) ( 0, 0) ( 6, 6) ( 0, 0) ( 0, 0) ( 0, 0) (-22,-12) ( -6, -6) ( 0, 0) val = 2147483647 0 0 0 0 0 intree = 0 0 0 0 0 0 k (next vertex added) = 1 Updating neighbors of 1 val[2] = 10 dad[2] = 1 New max is now 2 val[3] = 7 dad[3] = 1 val = 2147483647 10 7 0 0 0 intree = 1 0 0 0 0 0 k (next vertex added) = 2 Updating neighbors of 2 val[3] = 9 dad[3] = 2 New max is now 3 val[5] = 8 dad[5] = 2 val = 2147483647 10 9 0 8 0 intree = 1 1 0 0 0 0 k (next vertex added) = 3 Updating neighbors of 3 New max is now 5 val = 2147483647 10 9 0 8 0 intree = 1 1 1 0 0 0 k (next vertex added) = 5 Updating neighbors of 5 After 3 augmentations, the Max Flow result is: 18 ------------------------------------------------------------------------------ File name? > m10.max After 51 augmentations, the Max Flow result is: 9860177 ------------------------------------------------------------------------------ File name? > m30.max After 163 augmentations, the Max Flow result is: 28258807