equal
deleted
inserted
replaced
290 /// val[graph(i, j)] = i + j; |
290 /// val[graph(i, j)] = i + j; |
291 /// } |
291 /// } |
292 /// } |
292 /// } |
293 ///\endcode |
293 ///\endcode |
294 /// |
294 /// |
295 /// The graph type is fully conform to the \ref concept::UGraph |
295 /// The graph type is fully conform to the \ref concepts::UGraph |
296 /// "Undirected Graph" concept, and it also has an |
296 /// "Undirected Graph" concept, and it also has an |
297 ///important extra feature that |
297 ///important extra feature that |
298 ///its maps are real \ref concept::ReferenceMap "reference map"s. |
298 ///its maps are real \ref concepts::ReferenceMap "reference map"s. |
299 /// |
299 /// |
300 /// |
300 /// |
301 /// \author Balazs Dezso |
301 /// \author Balazs Dezso |
302 class GridUGraph : public ExtendedGridUGraphBase { |
302 class GridUGraph : public ExtendedGridUGraphBase { |
303 public: |
303 public: |