Index: lemon/list_graph.h
===================================================================
--- lemon/list_graph.h (revision 2098)
+++ lemon/list_graph.h (revision 2102)
@@ -317,6 +317,6 @@
///This is a simple and fast erasable graph implementation.
///
- ///It addition that it conforms to the
- ///\ref concept::ErasableGraph "ErasableGraph" concept,
+ ///It conforms to the
+ ///\ref concept::ErasableGraph "ErasableGraph" concept and
///it also provides several additional useful extra functionalities.
///\sa concept::ErasableGraph.
@@ -331,7 +331,7 @@
/// Changes the target of \c e to \c n
///
- ///\note The Edge's and OutEdge's
+ ///\note The Edges and OutEdges
///referencing the changed edge remain
- ///valid. However InEdge's are invalidated.
+ ///valid. However InEdges are invalidated.
void changeTarget(Edge e, Node n) {
_changeTarget(e,n);
@@ -341,7 +341,7 @@
/// Changes the source of \c e to \c n
///
- ///\note The Edge's and InEdge's
+ ///\note The Edges and InEdges
///referencing the changed edge remain
- ///valid. However OutEdge's are invalidated.
+ ///valid. However OutEdges are invalidated.
void changeSource(Edge e, Node n) {
_changeSource(e,n);
@@ -350,7 +350,7 @@
/// Invert the direction of an edge.
- ///\note The Edge's
+ ///\note The Edges
///referencing the changed edge remain
- ///valid. However OutEdge's and InEdge's are invalidated.
+ ///valid. However OutEdges and InEdges are invalidated.
void reverseEdge(Edge e) {
Node t=target(e);
@@ -359,7 +359,7 @@
}
- ///Using this it possible to avoid the superfluous memory allocation.
-
- ///Using this it possible to avoid the superfluous memory allocation.
+ ///Using this it is possible to avoid the superfluous memory allocation.
+
+ ///Using this it is possible to avoid the superfluous memory allocation.
///\todo more docs...
void reserveEdge(int n) { edges.reserve(n); };
@@ -370,5 +370,5 @@
///
///Node \p b will be removed but instead of deleting
- ///its neighboring edges, they will be joined to \p a.
+ ///incident edges, they will be joined to \p a.
///The last parameter \p r controls whether to remove loops. \c true
///means that loops will be removed.
@@ -376,5 +376,5 @@
///\note The Edges
///referencing a moved edge remain
- ///valid. However InEdge's and OutEdge's
+ ///valid. However InEdges and OutEdges
///may be invalidated.
void contract(Node a, Node b, bool r = true)
@@ -407,5 +407,5 @@
///\note The Edges
///referencing a moved edge remain
- ///valid. However InEdge's and OutEdge's
+ ///valid. However InEdges and OutEdges
///may be invalidated.
///\warning This functionality cannot be used together with the Snapshot
@@ -427,10 +427,10 @@
///Split an edge.
- ///This function splits an edge. First a new node \c b is added to the graph,
- ///then the original edge is re-targetes to \c b. Finally an edge
- ///from \c b to the original target is added.
- ///\return The newly created node.
- ///\warning This functionality cannot be used together with the Snapshot
- ///feature.
+ ///This function splits an edge. First a new node \c b is added to
+ ///the graph, then the original edge is re-targeted to \c
+ ///b. Finally an edge from \c b to the original target is added.
+ ///\return The newly created node.
+ ///\warning This functionality
+ ///cannot be used together with the Snapshot feature.
Node split(Edge e)
{
@@ -441,7 +441,7 @@
}
- ///Class to make a snapshot of the graph and to restrore to it later.
-
- ///Class to make a snapshot of the graph and to restrore to it later.
+ ///Class to make a snapshot of the graph and to restore it later.
+
+ ///Class to make a snapshot of the graph and to restore it later.
///
///The newly added nodes and edges can be removed using the