---

SDAGLayouter Class Reference

#include <SDAGLayouter.h>

List of all members.

Public Methods
	SDAGLayouter ()
const leda_list< leda_string > &	getLayoutAlgs ()
bool	layout (const leda_string &alg, const leda_graph &g, const leda_node_array< leda_point > &sizes, leda_point windowSize, leda_node_array< leda_point > &posArray, leda_edge_array< leda_list< leda_point > > &bends)

---

Detailed Description

This class is responsible for the layout/placement of the dag.

---

Constructor & Destructor Documentation

SDAGLayouter::SDAGLayouter (    )

---

Member Function Documentation

const leda_list<leda_string>& SDAGLayouter::getLayoutAlgs (    )  [inline]

Returns: list of names of layout-algorithms

bool SDAGLayouter::layout (  const leda_string &    alg, const leda_graph &    g, const leda_node_array< leda_point > &    sizes, leda_point    windowSize, leda_node_array< leda_point > &    posArray, leda_edge_array< leda_list< leda_point > > &    bends )

Layouts the graph with the specified algorithm. Parameters: alg  the algorithm which is used (an entry of the getLayoutAlgs() list). nodeSizes  the sizes of all nodes. windowSize  width and height of the window (one or both might be ignored). posArray  here the new positions are returned. bends  here the bends in the edges are returned. Caution: The bends don't include the start and the end node of the edge Returns: true, if layout algorithm can be applied to the graph. some algorithm are only suitable for certain types of graphs, e.g. trees.

---

The documentation for this class was generated from the following files:

• visualization/SDAGLayouter.h
• visualization/SDAGLayouter.cpp

---