Index: lemon/grid_graph.h
===================================================================
--- lemon/grid_graph.h (revision 347)
+++ lemon/grid_graph.h (revision 348)
@@ -185,4 +185,5 @@
class Edge {
friend class GridGraphBase;
+ friend class Arc;
protected:
@@ -473,6 +474,6 @@
/// [0..height()-1] range. Two nodes are connected in the graph if
/// the indexes differ exactly on one position and exactly one is
- /// the difference. The nodes of the graph be indexed by position
- /// with \c operator()() function. The positions of the nodes can be
+ /// the difference. The nodes of the graph can be indexed by position
+ /// with the \c operator()() function. The positions of the nodes can be
/// get with \c pos(), \c col() and \c row() members. The outgoing
/// arcs can be retrieved with the \c right(), \c up(), \c left()
@@ -481,5 +482,5 @@
///
/// \image html grid_graph.png
- /// \image latex grid_graph.eps "Grid digraph" row_num=\textrow_num
+ /// \image latex grid_graph.eps "Grid graph" row_num=\textrow_num
///
/// A short example about the basic usage:
@@ -494,8 +495,8 @@
///\endcode
///
- /// The graph type is fully conform to the \ref concepts::Graph
+ /// This graph type is fully conform to the \ref concepts::Graph
/// "Graph" concept, and it also has an important extra feature
- /// that its maps are real \ref concepts::ReferenceMap "reference
- /// map"s.
+ /// that its maps are real \ref concepts::ReferenceMap
+ /// "reference map"s.
class GridGraph : public ExtendedGridGraphBase {
public:
Index: test/graph_test.cc
===================================================================
--- test/graph_test.cc (revision 347)
+++ test/graph_test.cc (revision 348)
@@ -193,6 +193,6 @@
Graph G(width, height);
- check(G.width() == width, "Wrong row number");
- check(G.height() == height, "Wrong column number");
+ check(G.width() == width, "Wrong column number");
+ check(G.height() == height, "Wrong row number");
for (int i = 0; i < width; ++i) {