Main Page | Modules | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members | Related Pages

GridGraph Class Reference
[Graph Structures]

#include <lemon/grid_graph.h>

List of all members.


Detailed Description

This class implements a special graph type. The nodes of the graph can be indiced by two integer (i,j) value where i is in the [0,height) range and j is in the [0, width) range. Two nodes are connected in the graph if the indices differ only on one position and only one is the difference.

The graph can be indiced in the following way:

      GridGraph graph(h, w);
      GridGraph::NodeMap<int> val(graph); 
      for (int i = 0; i < graph.height(); ++i) {
        for (int j = 0; j < graph.width(); ++j) {
          val[graph(i, j)] = i + j;
        }
      }

The graph type is fully conform to the Undirected Graph concept.

Author:
Balazs Dezso


The documentation for this class was generated from the following file:
Generated on Sat Aug 27 14:15:37 2005 for LEMON by  doxygen 1.4.4