equal
deleted
inserted
replaced
259 /// graph can be indiced by two integer \c (i,j) value where \c i |
259 /// graph can be indiced by two integer \c (i,j) value where \c i |
260 /// is in the \c [0,height) range and j is in the [0, width) range. |
260 /// is in the \c [0,height) range and j is in the [0, width) range. |
261 /// Two nodes are connected in the graph if the indices differ only |
261 /// Two nodes are connected in the graph if the indices differ only |
262 /// on one position and only one is the difference. |
262 /// on one position and only one is the difference. |
263 /// |
263 /// |
264 /// The graph can be indiced in the following was: |
264 /// The graph can be indiced in the following way: |
265 /// \code |
265 /// \code |
266 /// MatrixGraph graph(h, w); |
266 /// MatrixGraph graph(h, w); |
267 /// MatrixGraph::NodeMap<int> val(graph); |
267 /// MatrixGraph::NodeMap<int> val(graph); |
268 /// for (int i = 0; i < graph.height(); ++i) { |
268 /// for (int i = 0; i < graph.height(); ++i) { |
269 /// for (int j = 0; j < graph.width(); ++j) { |
269 /// for (int j = 0; j < graph.width(); ++j) { |