equal
deleted
inserted
replaced
175 void constraints() { |
175 void constraints() { |
176 checkConcept<GraphItem<'n'>, Node>(); |
176 checkConcept<GraphItem<'n'>, Node>(); |
177 checkConcept<GraphItem<'e'>, Edge>(); |
177 checkConcept<GraphItem<'e'>, Edge>(); |
178 { |
178 { |
179 Node n; |
179 Node n; |
180 Edge e; |
180 Edge e(INVALID); |
181 n = graph.source(e); |
181 n = graph.source(e); |
182 n = graph.target(e); |
182 n = graph.target(e); |
183 } |
183 } |
184 } |
184 } |
185 |
185 |
716 checkConcept<GraphIterator<_Graph, typename _Graph::Node>, |
716 checkConcept<GraphIterator<_Graph, typename _Graph::Node>, |
717 typename _Graph::NodeIt >(); |
717 typename _Graph::NodeIt >(); |
718 checkConcept<GraphIncIterator<_Graph>, typename _Graph::InEdgeIt>(); |
718 checkConcept<GraphIncIterator<_Graph>, typename _Graph::InEdgeIt>(); |
719 checkConcept<GraphIncIterator<_Graph>, typename _Graph::OutEdgeIt>(); |
719 checkConcept<GraphIncIterator<_Graph>, typename _Graph::OutEdgeIt>(); |
720 |
720 |
721 typename _Graph::Node n; |
721 typename _Graph::Node n(INVALID); |
722 typename _Graph::Edge e; |
722 typename _Graph::Edge e(INVALID); |
723 n = graph.oppositeNode(n, e); |
723 n = graph.oppositeNode(n, e); |
724 } |
724 } |
725 |
725 |
726 const _Graph& graph; |
726 const _Graph& graph; |
727 |
727 |