equal
deleted
inserted
replaced
406 struct Constraints { |
406 struct Constraints { |
407 void constraints() { |
407 void constraints() { |
408 checkConcept<BaseGraphComponent, _Graph >(); |
408 checkConcept<BaseGraphComponent, _Graph >(); |
409 typename _Graph::Node node_a, node_b; |
409 typename _Graph::Node node_a, node_b; |
410 node_a = graph.addNode(); |
410 node_a = graph.addNode(); |
|
411 node_b = graph.addNode(); |
411 typename _Graph::Edge edge; |
412 typename _Graph::Edge edge; |
412 edge = graph.addEdge(node_a, node_b); |
413 edge = graph.addEdge(node_a, node_b); |
413 } |
414 } |
414 |
415 |
415 _Graph& graph; |
416 _Graph& graph; |
925 struct Constraints { |
926 struct Constraints { |
926 void constraints() { |
927 void constraints() { |
927 checkConcept<BaseGraphComponent, _Graph >(); |
928 checkConcept<BaseGraphComponent, _Graph >(); |
928 typename _Graph::Node node_a, node_b; |
929 typename _Graph::Node node_a, node_b; |
929 node_a = graph.addNode(); |
930 node_a = graph.addNode(); |
|
931 node_b = graph.addNode(); |
930 typename _Graph::Edge edge; |
932 typename _Graph::Edge edge; |
931 edge = graph.addEdge(node_a, node_b); |
933 edge = graph.addEdge(node_a, node_b); |
932 } |
934 } |
933 _Graph& graph; |
935 _Graph& graph; |
934 }; |
936 }; |