This module provides facilities to define and manipulate the layout (i.e. the coordinates of the nodes) of a graph. This section allows you to access the C++ source files of the module. This module is part of Bpp/Graph . The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here. The files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary dependent of the files listed here. <bpp/file_name.hpp>
<bpp/modules.hpp>
The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module. dataStructure
graphStructure
The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it. tdGraph = class prArcData,class prNodeData
tuGraph = prArcData,prNodeData
Here are listed the types defined in the module. To use one of them, you have to specify the namespace of the module. structure { tyCardinal x; tyCardinal y; } tyCoordinate; Coordinates of a node in a graph layout.
type std_map(tyNodeKey,tyCoordinate) clGraphLayout Layout of a graph: association of node keys with their coordinate.
Here are listed the constants provided by the module. To use one of them, you have to specify the namespace of the module. Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module. template <tdGraph> void generateGraphLayout(clGraph<tuGraph> & agGraph,clGraphLayout & agLayout) Generates randomly the layout of a graph.
template <class prData> void generateBinaryTreeLayout(clGraph<clNoData,prData> & agGraph,const clBinaryTree<prData> & agTree,clGraphLayout & agLayout) Generates the layout of a binary tree. The tree is converted into a graph and a layout is built for this graph.
template <tdGraph> void improveGraphLayout(clGraph<tuGraph> & agGraph,clGraphLayout & agLayout) Attempts to improve the layout of a graph according to the graph structure. This is a heuristic, so the result is sometimes not very good, especially for large graphs.
function clOutStream & operator << (clOutStream & agStream,ctGraphLayout & agLayout) Writes the layout of a graph into a stream.
function clInStream & operator >> (clInStream & agStream,clGraphLayout & agLayout) Reads the layout of a graph from a stream.
function void getBoundingBox(ctGraphLayout & agLayout,tyCoordinate & agCorner1,tyCoordinate & agCorner2) Finds the bounding box of the layout of a graph.
function void numberLayoutKeys(clGraphLayout & agLayout) Numbers from 0 the keys of the layout.
function void convertEps(clOutStream & agStream,ctGenericGraph & agGraph,clGraphLayout & agLayout,tyBoolean agNodeData,tyBoolean agArcData,tyBoolean agNodeKey,tyBoolean agArcKey,tyBoolean agTextCentered,tyBoolean agReversed,tyBoolean agMirrored,tyBoolean agFlipped,tyReal agSpaceCoefficient,tyReal agNodeRadius) Converts a graph into the EPS (Encapsulated PostScript) format and sends it into a stream.
| | Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net | Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org). |
|
| |