Index: lemon/list_graph.h
===================================================================
--- lemon/list_graph.h (revision 2117)
+++ lemon/list_graph.h (revision 2123)
@@ -167,4 +167,6 @@
/// Adds a new node to the graph.
+ /// Adds a new node to the graph.
+ ///
/// \warning It adds the new node to the front of the list.
/// (i.e. the lastly added node becomes the first.)
@@ -350,4 +352,6 @@
///the changed edge remain valid. However InEdgeIts are
///invalidated.
+ ///\warning This functionality cannot be used together with the Snapshot
+ ///feature.
void changeTarget(Edge e, Node n) {
Parent::changeTarget(e,n);
@@ -360,4 +364,6 @@
///the changed edge remain valid. However OutEdgeIts are
///invalidated.
+ ///\warning This functionality cannot be used together with the Snapshot
+ ///feature.
void changeSource(Edge e, Node n) {
Parent::changeSource(e,n);
@@ -369,4 +375,6 @@
///valid. However OutEdgeIts and InEdgeIts are
///invalidated.
+ ///\warning This functionality cannot be used together with the Snapshot
+ ///feature.
void reverseEdge(Edge e) {
Node t=target(e);
@@ -380,5 +388,5 @@
///Using this it is possible to avoid the superfluous memory
///allocation: if you know that the graph you want to build will
- ///contain at least 10 million nodes then it is worth to reserve
+ ///contain at least 10 million nodes then it is worth reserving
///space for this amount before starting to build the graph.
void reserveNode(int n) { nodes.reserve(n); };
@@ -405,4 +413,6 @@
///valid. However InEdges and OutEdges
///may be invalidated.
+ ///\warning This functionality cannot be used together with the Snapshot
+ ///feature.
void contract(Node a, Node b, bool r = true)
{
@@ -681,7 +691,5 @@
/// \brief Undo the changes until the last snapshot.
//
- /// Undo the changes until last snapshot created by save().
- ///
- /// \todo This function might be called undo().
+ /// Undo the changes until the last snapshot created by save().
void restore() {
detach();
Index: lemon/smart_graph.h
===================================================================
--- lemon/smart_graph.h (revision 2116)
+++ lemon/smart_graph.h (revision 2123)
@@ -240,5 +240,5 @@
///node and edge deletions.
///It conforms to
- ///the \ref concept::Graph "Graph" concept.
+ ///the \ref concept::Graph "Graph concept".
///\sa concept::Graph.
///
@@ -371,5 +371,5 @@
/// node and edge deletions.
/// Except from this it conforms to
- /// the \ref concept::UGraph "UGraph" concept.
+ /// the \ref concept::UGraph "UGraph concept".
/// \sa concept::UGraph.
///
@@ -605,5 +605,5 @@
/// that it does not support node and edge deletions.
/// Except from this it conforms to
- /// the \ref concept::BpUGraph "BpUGraph" concept.
+ /// the \ref concept::BpUGraph "BpUGraph concept".
/// \sa concept::BpUGraph.
///