1.1 --- a/lemon/hypercube_graph.h Sun Nov 15 19:57:02 2009 +0100
1.2 +++ b/lemon/hypercube_graph.h Wed Nov 18 14:38:02 2009 +0100
1.3 @@ -287,7 +287,7 @@
1.4 /// Two nodes are connected in the graph if and only if their indices
1.5 /// differ only on one position in the binary form.
1.6 /// This class is completely static and it needs constant memory space.
1.7 - /// Thus you can neither add nor delete nodes or edges, however
1.8 + /// Thus you can neither add nor delete nodes or edges, however,
1.9 /// the structure can be resized using resize().
1.10 ///
1.11 /// This type fully conforms to the \ref concepts::Graph "Graph concept".