equal
deleted
inserted
replaced
94 s = const_bf_test.predNode(t); |
94 s = const_bf_test.predNode(t); |
95 b = const_bf_test.reached(t); |
95 b = const_bf_test.reached(t); |
96 d = const_bf_test.distMap(); |
96 d = const_bf_test.distMap(); |
97 p = const_bf_test.predMap(); |
97 p = const_bf_test.predMap(); |
98 pp = const_bf_test.path(t); |
98 pp = const_bf_test.path(t); |
|
99 pp = const_bf_test.negativeCycle(); |
99 |
100 |
100 for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {} |
101 for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {} |
101 } |
102 } |
102 { |
103 { |
103 BF::SetPredMap<concepts::ReadWriteMap<Node,Arc> > |
104 BF::SetPredMap<concepts::ReadWriteMap<Node,Arc> > |
130 l = bf_test.dist(t); |
131 l = bf_test.dist(t); |
131 e = bf_test.predArc(t); |
132 e = bf_test.predArc(t); |
132 s = bf_test.predNode(t); |
133 s = bf_test.predNode(t); |
133 b = bf_test.reached(t); |
134 b = bf_test.reached(t); |
134 pp = bf_test.path(t); |
135 pp = bf_test.path(t); |
|
136 pp = bf_test.negativeCycle(); |
135 } |
137 } |
136 } |
138 } |
137 |
139 |
138 void checkBellmanFordFunctionCompile() |
140 void checkBellmanFordFunctionCompile() |
139 { |
141 { |