next up previous contents index
Next: Concept for Graph Copies Up: Implementation of Layout Algorithms Previous: Implementation of Layout Algorithms   Contents   Index


Concept for LEDA Graphs ( ConstLedaGraphConcept )

Definition

The class ConstLedaGraphConcept represents an implementation concept for layout algorithms which work on a const LEDA graph G and access the layout via a layout interface A. The graph cannot be modified by the algorithm.

#include < AGD/ConstLedaGraphConcept.h >

Operations

ConstLedaGraphConcept implements the constructors and operations which are required for template argument CONCEPT of LayoutModuleImpl. Furthermore, the following operations are provided:

const leda_graph& C.get_graph() returns the const LEDA graph G.

LayoutInterface& C.get_layout() returns the layout interface A for G.



© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13