src/lemon/concept/sym_graph.h
changeset 1022 567f392d1d2e
parent 959 c80ef5912903
child 1164 80bb73097736
equal deleted inserted replaced
0:53e5619e10a7 1:15fe0a78f327
   448 
   448 
   449       /// The first symmetric edge of the Graph.
   449       /// The first symmetric edge of the Graph.
   450       ///
   450       ///
   451       SymEdgeIt& first(SymEdgeIt& i) const { return i; }
   451       SymEdgeIt& first(SymEdgeIt& i) const { return i; }
   452 
   452 
   453       ///Gives back the head node of an edge.
   453       ///Gives back the target node of an edge.
   454 
   454 
   455       ///Gives back the head node of an edge.
   455       ///Gives back the target node of an edge.
   456       ///
   456       ///
   457       Node head(Edge) const { return INVALID; }
   457       Node target(Edge) const { return INVALID; }
   458       ///Gives back the tail node of an edge.
   458       ///Gives back the source node of an edge.
   459 
   459 
   460       ///Gives back the tail node of an edge.
   460       ///Gives back the source node of an edge.
   461       ///
   461       ///
   462       Node tail(Edge) const { return INVALID; }
   462       Node source(Edge) const { return INVALID; }
   463   
   463   
   464       ///Gives back the first node of an symmetric edge.
   464       ///Gives back the first node of an symmetric edge.
   465 
   465 
   466       ///Gives back the first node of an symmetric edge.
   466       ///Gives back the first node of an symmetric edge.
   467       ///
   467       ///
   468       Node head(SymEdge) const { return INVALID; }
   468       Node target(SymEdge) const { return INVALID; }
   469       ///Gives back the second node of an symmetric edge.
   469       ///Gives back the second node of an symmetric edge.
   470 
   470 
   471       ///Gives back the second node of an symmetric edge.
   471       ///Gives back the second node of an symmetric edge.
   472       ///
   472       ///
   473       Node tail(SymEdge) const { return INVALID; }
   473       Node source(SymEdge) const { return INVALID; }
   474       ///Gives back the \e id of a node.
   474       ///Gives back the \e id of a node.
   475 
   475 
   476       ///\warning Not all graph structures provide this feature.
   476       ///\warning Not all graph structures provide this feature.
   477       ///
   477       ///
   478       ///\todo Should each graph provide \c id?
   478       ///\todo Should each graph provide \c id?
   605       /// \return the new node.
   605       /// \return the new node.
   606       ///
   606       ///
   607       Node addNode() { return INVALID; }
   607       Node addNode() { return INVALID; }
   608       ///Add a new edge to the graph.
   608       ///Add a new edge to the graph.
   609 
   609 
   610       ///Add a new symmetric edge to the graph with tail node \c t
   610       ///Add a new symmetric edge to the graph with source node \c t
   611       ///and head node \c h.
   611       ///and target node \c h.
   612       ///\return the new edge.
   612       ///\return the new edge.
   613       SymEdge addEdge(Node h, Node t) { return INVALID; }
   613       SymEdge addEdge(Node h, Node t) { return INVALID; }
   614     
   614     
   615       /// Resets the graph.
   615       /// Resets the graph.
   616 
   616