1.1 --- a/lemon/concepts/graph.h Thu Mar 05 10:13:20 2009 +0000
1.2 +++ b/lemon/concepts/graph.h Sun Mar 29 23:08:20 2009 +0200
1.3 @@ -601,23 +601,35 @@
1.4
1.5 /// \brief Opposite node on an arc
1.6 ///
1.7 - /// \return the opposite of the given Node on the given Edge
1.8 + /// \return The opposite of the given node on the given edge.
1.9 Node oppositeNode(Node, Edge) const { return INVALID; }
1.10
1.11 /// \brief First node of the edge.
1.12 ///
1.13 - /// \return the first node of the given Edge.
1.14 + /// \return The first node of the given edge.
1.15 ///
1.16 /// Naturally edges don't have direction and thus
1.17 - /// don't have source and target node. But we use these two methods
1.18 - /// to query the two nodes of the arc. The direction of the arc
1.19 - /// which arises this way is called the inherent direction of the
1.20 + /// don't have source and target node. However we use \c u() and \c v()
1.21 + /// methods to query the two nodes of the arc. The direction of the
1.22 + /// arc which arises this way is called the inherent direction of the
1.23 /// edge, and is used to define the "default" direction
1.24 /// of the directed versions of the arcs.
1.25 - /// \sa direction
1.26 + /// \sa v()
1.27 + /// \sa direction()
1.28 Node u(Edge) const { return INVALID; }
1.29
1.30 /// \brief Second node of the edge.
1.31 + ///
1.32 + /// \return The second node of the given edge.
1.33 + ///
1.34 + /// Naturally edges don't have direction and thus
1.35 + /// don't have source and target node. However we use \c u() and \c v()
1.36 + /// methods to query the two nodes of the arc. The direction of the
1.37 + /// arc which arises this way is called the inherent direction of the
1.38 + /// edge, and is used to define the "default" direction
1.39 + /// of the directed versions of the arcs.
1.40 + /// \sa u()
1.41 + /// \sa direction()
1.42 Node v(Edge) const { return INVALID; }
1.43
1.44 /// \brief Source node of the directed arc.