equal
deleted
inserted
replaced
138 /// In addition, this class provides two iterators called \ref TrueIt |
138 /// In addition, this class provides two iterators called \ref TrueIt |
139 /// and \ref FalseIt to iterate through the "true" and "false" nodes. |
139 /// and \ref FalseIt to iterate through the "true" and "false" nodes. |
140 template <class Graph> |
140 template <class Graph> |
141 class IterableBoolNodeMap |
141 class IterableBoolNodeMap |
142 { |
142 { |
143 typename Graph::NodeMap<int> cmap; |
143 typename Graph::template NodeMap<int> cmap; |
144 |
144 |
145 public: |
145 public: |
146 |
146 |
147 typedef IterableBoolMap<typename Graph::NodeMap<int> > BimType; |
147 typedef IterableBoolMap<typename Graph::template NodeMap<int> > BimType; |
148 BimType imap; |
148 BimType imap; |
149 |
149 |
150 |
150 |
151 typedef typename BimType::RefType RefType; |
151 typedef typename BimType::RefType RefType; |
152 typedef typename Graph::Node Key; |
152 typedef typename Graph::Node Key; |
196 /// In addition, this class provides two iterators called \ref TrueIt |
196 /// In addition, this class provides two iterators called \ref TrueIt |
197 /// and \ref FalseIt to iterate through the "true" and "false" edges. |
197 /// and \ref FalseIt to iterate through the "true" and "false" edges. |
198 template <class Graph> |
198 template <class Graph> |
199 class IterableBoolEdgeMap |
199 class IterableBoolEdgeMap |
200 { |
200 { |
201 typename Graph::EdgeMap<int> cmap; |
201 typename Graph::template EdgeMap<int> cmap; |
202 |
202 |
203 public: |
203 public: |
204 |
204 |
205 typedef IterableBoolMap<typename Graph::EdgeMap<int> > BimType; |
205 typedef IterableBoolMap<typename Graph::template EdgeMap<int> > BimType; |
206 BimType imap; |
206 BimType imap; |
207 |
207 |
208 |
208 |
209 typedef typename BimType::RefType RefType; |
209 typedef typename BimType::RefType RefType; |
210 typedef typename Graph::Edge Key; |
210 typedef typename Graph::Edge Key; |