FilesExpand file tree

 master

/

MaxFlowTest.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

150 lines (124 loc) · 4.69 KB

 master

/

MaxFlowTest.java

Copy path

Top

File metadata and controls

• Code
• Blame

150 lines (124 loc) · 4.69 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

import static org.junit.Assert.assertEquals;

import static org.junit.Assert.assertTrue;

import java.util.Arrays;

import org.junit.Test;

/**

* From: https://github.com/atcoder/ac-library/blob/1ca9100261b8c27cf62acccc3618c5e8375bf57b/test/unittest/maxflow_test.cpp

*/

public class MaxFlowTest {

@Test

public void simple() {

MaxFlow g = new MaxFlow(4);

assertEquals(0, g.addEdge(0, 1, 1));

assertEquals(1, g.addEdge(0, 2, 1));

assertEquals(2, g.addEdge(1, 3, 1));

assertEquals(3, g.addEdge(2, 3, 1));

assertEquals(4, g.addEdge(1, 2, 1));

assertEquals(2, g.maxFlow(0, 3));

MaxFlow.CapEdge e;

e = new MaxFlow.CapEdge(0, 1, 1, 1);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(0, 2, 1, 1);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(1, 3, 1, 1);

assertEquals(e, g.getEdge(2));

e = new MaxFlow.CapEdge(2, 3, 1, 1);

assertEquals(e, g.getEdge(3));

e = new MaxFlow.CapEdge(1, 2, 1, 0);

assertEquals(e, g.getEdge(4));

assertTrue(Arrays.equals(new boolean[]{true, false, false, false}, g.minCut(0)));

}

@Test

public void notSimple() {

MaxFlow g = new MaxFlow(2);

assertEquals(0, g.addEdge(0, 1, 1));

assertEquals(1, g.addEdge(0, 1, 2));

assertEquals(2, g.addEdge(0, 1, 3));

assertEquals(3, g.addEdge(0, 1, 4));

assertEquals(4, g.addEdge(0, 1, 5));

assertEquals(5, g.addEdge(0, 0, 6));

assertEquals(6, g.addEdge(1, 1, 7));

assertEquals(15, g.maxFlow(0, 1));

MaxFlow.CapEdge e;

e = new MaxFlow.CapEdge(0, 1, 1, 1);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(0, 1, 2, 2);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(0, 1, 3, 3);

assertEquals(e, g.getEdge(2));

e = new MaxFlow.CapEdge(0, 1, 4, 4);

assertEquals(e, g.getEdge(3));

e = new MaxFlow.CapEdge(0, 1, 5, 5);

assertEquals(e, g.getEdge(4));

assertTrue(Arrays.equals(new boolean[]{true, false}, g.minCut(0)));

}

@Test

public void cut() {

MaxFlow g = new MaxFlow(3);

assertEquals(0, g.addEdge(0, 1, 2));

assertEquals(1, g.addEdge(1, 2, 1));

assertEquals(1, g.maxFlow(0, 2));

MaxFlow.CapEdge e;

e = new MaxFlow.CapEdge(0, 1, 2, 1);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(1, 2, 1, 1);

assertEquals(e, g.getEdge(1));

assertTrue(Arrays.equals(new boolean[]{true, true, false}, g.minCut(0)));

}

@Test

public void twise() {

MaxFlow.CapEdge e;

MaxFlow g = new MaxFlow(3);

assertEquals(0, g.addEdge(0, 1, 1));

assertEquals(1, g.addEdge(0, 2, 1));

assertEquals(2, g.addEdge(1, 2, 1));

assertEquals(2, g.maxFlow(0, 2));

e = new MaxFlow.CapEdge(0, 1, 1, 1);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(0, 2, 1, 1);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(1, 2, 1, 1);

assertEquals(e, g.getEdge(2));

g.changeEdge(0, 100, 10);

e = new MaxFlow.CapEdge(0, 1, 100, 10);

assertEquals(e, g.getEdge(0));

assertEquals(0, g.maxFlow(0, 2));

assertEquals(90, g.maxFlow(0, 1));

e = new MaxFlow.CapEdge(0, 1, 100, 100);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(0, 2, 1, 1);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(1, 2, 1, 1);

assertEquals(e, g.getEdge(2));

assertEquals(2, g.maxFlow(2, 0));

e = new MaxFlow.CapEdge(0, 1, 100, 99);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(0, 2, 1, 0);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(1, 2, 1, 0);

assertEquals(e, g.getEdge(2));

}

@Test

public void bound() {

MaxFlow.CapEdge e;

long INF = MaxFlow.INF;

MaxFlow g = new MaxFlow(3);

assertEquals(0, g.addEdge(0, 1, INF));

assertEquals(1, g.addEdge(1, 0, INF));

assertEquals(2, g.addEdge(0, 2, INF));

assertEquals(INF, g.maxFlow(0, 2));

e = new MaxFlow.CapEdge(0, 1, INF, 0);

assertEquals(e, g.getEdge(0));

e = new MaxFlow.CapEdge(1, 0, INF, 0);

assertEquals(e, g.getEdge(1));

e = new MaxFlow.CapEdge(0, 2, INF, INF);

assertEquals(e, g.getEdge(2));

}

@Test

public void selfLoop() {

MaxFlow g = new MaxFlow(3);

assertEquals(0, g.addEdge(0, 0, 100));

MaxFlow.CapEdge e = new MaxFlow.CapEdge(0, 0, 100, 0);

assertEquals(e, g.getEdge(0));

}

}