lemon/concepts/graph_components.h
changeset 102 81563e019fa4
parent 57 c1acf0018c0a
child 107 31a2e6d28f61
equal deleted inserted replaced
0:0c29854eb20b 1:e9ac78d8582d
   826       /// \brief This iterator goes trough the incident arcs of a
   826       /// \brief This iterator goes trough the incident arcs of a
   827       /// node.
   827       /// node.
   828       ///
   828       ///
   829       /// This iterator goes trough the incident arcs of a certain
   829       /// This iterator goes trough the incident arcs of a certain
   830       /// node of a graph.
   830       /// node of a graph.
   831       typedef GraphIncIt<Graph, Edge, Node, 'u'> IncArcIt;
   831       typedef GraphIncIt<Graph, Edge, Node, 'u'> IncEdgeIt;
   832       /// \brief The base node of the iterator.
   832       /// \brief The base node of the iterator.
   833       ///
   833       ///
   834       /// Gives back the base node of the iterator.
   834       /// Gives back the base node of the iterator.
   835       Node baseNode(const IncArcIt&) const { return INVALID; }
   835       Node baseNode(const IncEdgeIt&) const { return INVALID; }
   836 
   836 
   837       /// \brief The running node of the iterator.
   837       /// \brief The running node of the iterator.
   838       ///
   838       ///
   839       /// Gives back the running node of the iterator.
   839       /// Gives back the running node of the iterator.
   840       Node runningNode(const IncArcIt&) const { return INVALID; }
   840       Node runningNode(const IncEdgeIt&) const { return INVALID; }
   841 
   841 
   842       /// @}
   842       /// @}
   843 
   843 
   844       template <typename _Graph> 
   844       template <typename _Graph> 
   845       struct Constraints {
   845       struct Constraints {
   863   
   863   
   864           {
   864           {
   865             checkConcept<GraphItemIt<_Graph, typename _Graph::Edge>,
   865             checkConcept<GraphItemIt<_Graph, typename _Graph::Edge>,
   866               typename _Graph::EdgeIt >();
   866               typename _Graph::EdgeIt >();
   867             checkConcept<GraphIncIt<_Graph, typename _Graph::Edge, 
   867             checkConcept<GraphIncIt<_Graph, typename _Graph::Edge, 
   868               typename _Graph::Node, 'u'>, typename _Graph::IncArcIt>();
   868               typename _Graph::Node, 'u'>, typename _Graph::IncEdgeIt>();
   869             
   869             
   870             typename _Graph::Node n;
   870             typename _Graph::Node n;
   871             typename _Graph::IncArcIt ueit(INVALID);
   871             typename _Graph::IncEdgeIt ueit(INVALID);
   872             n = graph.baseNode(ueit);
   872             n = graph.baseNode(ueit);
   873             n = graph.runningNode(ueit);
   873             n = graph.runningNode(ueit);
   874           }
   874           }
   875         }
   875         }
   876 	
   876