lemon-1.2: comparison lemon/concepts/graph.h

equal deleted inserted replaced

-:10d46bf43ec4
+:a482cd69583f
 };
 /// Iterator class for the nodes.
 /// This iterator goes through each node of the graph.
-/// Its usage is quite simple, for example you can count the number
+/// Its usage is quite simple, for example, you can count the number
 /// of nodes in a graph \c g of type \c %Graph like this:
 ///\code
 /// int count=0;
 /// for (Graph::NodeIt n(g); n!=INVALID; ++n) ++count;
 ///\endcode
 };
 /// Iterator class for the edges.
 /// This iterator goes through each edge of the graph.
-/// Its usage is quite simple, for example you can count the number
+/// Its usage is quite simple, for example, you can count the number
 /// of edges in a graph \c g of type \c %Graph as follows:
 ///\code
 /// int count=0;
 /// for(Graph::EdgeIt e(g); e!=INVALID; ++e) ++count;
 ///\endcode
 /// Iterator class for the incident edges of a node.
 /// This iterator goes trough the incident undirected edges
 /// of a certain node of a graph.
-/// Its usage is quite simple, for example you can compute the
+/// Its usage is quite simple, for example, you can compute the
 /// degree (i.e. the number of incident edges) of a node \c n
 /// in a graph \c g of type \c %Graph as follows.
 ///
 ///\code
 /// int count=0;
 };
 /// Iterator class for the arcs.
 /// This iterator goes through each directed arc of the graph.
-/// Its usage is quite simple, for example you can count the number
+/// Its usage is quite simple, for example, you can count the number
 /// of arcs in a graph \c g of type \c %Graph as follows:
 ///\code
 /// int count=0;
 /// for(Graph::ArcIt a(g); a!=INVALID; ++a) ++count;
 ///\endcode
 /// Iterator class for the outgoing arcs of a node.
 /// This iterator goes trough the \e outgoing directed arcs of a
 /// certain node of a graph.
-/// Its usage is quite simple, for example you can count the number
+/// Its usage is quite simple, for example, you can count the number
 /// of outgoing arcs of a node \c n
 /// in a graph \c g of type \c %Graph as follows.
 ///\code
 /// int count=0;
 /// for (Digraph::OutArcIt a(g, n); a!=INVALID; ++a) ++count;
 /// Iterator class for the incoming arcs of a node.
 /// This iterator goes trough the \e incoming directed arcs of a
 /// certain node of a graph.
-/// Its usage is quite simple, for example you can count the number
+/// Its usage is quite simple, for example, you can count the number
 /// of incoming arcs of a node \c n
 /// in a graph \c g of type \c %Graph as follows.
 ///\code
 /// int count=0;
 /// for (Digraph::InArcIt a(g, n); a!=INVALID; ++a) ++count;
 /// \brief The first node of the edge.
 ///
 /// Returns the first node of the given edge.
 ///
-/// Edges don't have source and target nodes, however methods
+/// Edges don't have source and target nodes, however, methods
 /// u() and v() are used to query the two end-nodes of an edge.
 /// The orientation of an edge that arises this way is called
 /// the inherent direction, it is used to define the default
 /// direction for the corresponding arcs.
 /// \sa v()
 /// \brief The second node of the edge.
 ///
 /// Returns the second node of the given edge.
 ///
-/// Edges don't have source and target nodes, however methods
+/// Edges don't have source and target nodes, however, methods
 /// u() and v() are used to query the two end-nodes of an edge.
 /// The orientation of an edge that arises this way is called
 /// the inherent direction, it is used to define the default
 /// direction for the corresponding arcs.
 /// \sa u()

changeset 796	9cc6e98c487d
parent 734	bd72f8d20f33
child 877	141f9c0db4a3