| ... | ... | 
		@@ -114,23 +114,23 @@  | 
| 114 | 114 | 
		MaxCardinalitySearch<Digraph,CapMap> maxcard(g,cap);  | 
| 115 | 115 | 
		 | 
| 116 | 116 | 
		maxcard.init();  | 
| 117 | 117 | 
		maxcard.addSource(s);  | 
| 118 | 118 | 
		maxcard.start(x);  | 
| 119 | 119 | 
		 | 
| 120 | 
		check(maxcard.processed(s)  | 
|
| 120 | 
		check(maxcard.processed(s) && !maxcard.processed(x) &&  | 
|
| 121 | 121 | 
		!maxcard.processed(y), "Wrong processed()!");  | 
| 122 | 122 | 
		 | 
| 123 | 123 | 
		a=maxcard.nextNode();  | 
| 124 | 124 | 
		check(maxcard.processNextNode()==a,  | 
| 125 | 125 | 
		"Wrong nextNode() or processNextNode() return value!");  | 
| 126 | 126 | 
		 | 
| 127 | 127 | 
		check(maxcard.processed(a), "Wrong processNextNode()!");  | 
| 128 | 128 | 
		 | 
| 129 | 129 | 
		maxcard.start();  | 
| 130 | 
		check(maxcard.cardinality(x)==2  | 
|
| 130 | 
		check(maxcard.cardinality(x)==2 && maxcard.cardinality(y)>=4,  | 
|
| 131 | 131 | 
		"Wrong cardinalities!");  | 
| 132 | 132 | 
		}  | 
| 133 | 133 | 
		 | 
| 134 | 134 | 
		 void checkWithConst1Map(std::istringstream &input) {
	 | 
| 135 | 135 | 
		typedef SmartDigraph Digraph;  | 
| 136 | 136 | 
		typedef Digraph::Node Node;  | 
0 comments (0 inline)