The class FPPLayout represents the layout algorithm by de Fraysseix, Pach, Pollack [DPP90]. More...

#include <ogdf/planarlayout/FPPLayout.h>

Inheritance diagram for ogdf::FPPLayout:

Public Member Functions
	FPPLayout ()

Public Member Functions inherited from ogdf::PlanarGridLayoutModule
	PlanarGridLayoutModule ()
	Initializes a planar grid layout module.

virtual	~PlanarGridLayoutModule ()

void	callFixEmbed (GraphAttributes &AG, adjEntry adjExternal=nullptr)
	Calls the grid layout algorithm with a fixed planar embedding (general call).

void	callGridFixEmbed (const Graph &G, GridLayout &gridLayout, adjEntry adjExternal=nullptr)
	Calls the grid layout algorithm with a fixed planar embedding (call for GridLayout).

Public Member Functions inherited from ogdf::GridLayoutModule
	GridLayoutModule ()
	Initializes a grid layout module.

virtual	~GridLayoutModule ()

virtual void	call (GraphAttributes &GA) override final
	Calls the grid layout algorithm (general call).

void	callGrid (const Graph &G, GridLayout &gridLayout)
	Calls the grid layout algorithm (call for GridLayout).

const IPoint &	gridBoundingBox () const

double	separation () const
	Returns the current setting of the minimum distance between nodes.

void	separation (double sep)
	Sets the minimum distance between nodes.

Public Member Functions inherited from ogdf::LayoutModule
	LayoutModule ()
	Initializes a layout module.

virtual	~LayoutModule ()

void	operator() (GraphAttributes &GA)
	Computes a layout of graph `GA`.

Private Member Functions
void	computeCoordinates (const GraphCopy &G, IPoint &boundingBox, GridLayout &gridLayout, NodeArray< int > &num, NodeArray< adjEntry > &e_wp, NodeArray< adjEntry > &e_wq)

void	computeOrder (const GraphCopy &G, NodeArray< int > &num, NodeArray< adjEntry > &e_wp, NodeArray< adjEntry > &e_wq, adjEntry e_12, adjEntry e_2n, adjEntry e_n1)

virtual void	doCall (const Graph &G, adjEntry adjExternal, GridLayout &gridLayout, IPoint &boundingBox, bool fixEmbedding) override
	Implements the algorithm call.

Additional Inherited Members
Protected Member Functions inherited from ogdf::PlanarGridLayoutModule
virtual void	doCall (const Graph &G, GridLayout &gridLayout, IPoint &boundingBox) override
	Implements the GridLayoutModule::doCall().

bool	handleTrivial (const Graph &G, GridLayout &gridLayout, IPoint &boundingBox)
	Handles the special cases of graphs with less than 3 nodes.

Protected Attributes inherited from ogdf::GridLayoutModule
IPoint	m_gridBoundingBox
	The computed bounding box of the grid layout.

Detailed Description

The class FPPLayout represents the layout algorithm by de Fraysseix, Pach, Pollack [DPP90].

This algorithm draws a planar graph G straight-line without crossings. G must not contain self-loops or multiple edges. The grid layout size is (2n-4) * (n-2) for a graph with n nodes (n ≥ 3). The algorithm runs in three phases. In the ﬁrst phase, the graph is augmented by adding new artiﬁcial edges to get a triangulated plane graph. Then, a so-called shelling order (also called canonical ordering) for triangulated planar graphs is computed. In the third phase the vertices are placed incrementally according to the shelling order.

Definition at line 52 of file FPPLayout.h.

Constructor & Destructor Documentation

◆ FPPLayout()

ogdf::FPPLayout::FPPLayout ( )

Member Function Documentation

◆ computeCoordinates()

void ogdf::FPPLayout::computeCoordinates	(	const GraphCopy &	G,
		IPoint &	boundingBox,
		GridLayout &	gridLayout,
		NodeArray< int > &	num,
		NodeArray< adjEntry > &	e_wp,
		NodeArray< adjEntry > &	e_wq
	)

private

◆ computeOrder()

void ogdf::FPPLayout::computeOrder	(	const GraphCopy &	G,
		NodeArray< int > &	num,
		NodeArray< adjEntry > &	e_wp,
		NodeArray< adjEntry > &	e_wq,
		adjEntry	e_12,
		adjEntry	e_2n,
		adjEntry	e_n1
	)

private

◆ doCall()

virtual void ogdf::FPPLayout::doCall	(	const Graph &	G,
		adjEntry	adjExternal,
		GridLayout &	gridLayout,
		IPoint &	boundingBox,
		bool	fixEmbedding
	)

overrideprivatevirtual

Implements the algorithm call.

A derived algorithm must implement this method and return the computed grid layout in gridLayout.

Parameters

G	is the input graph.
adjExternal	is an adjacency entry on the external face, or 0 if no external face is specified.
gridLayout	is assigned the computed grid layout.
boundingBox	returns the bounding box of the grid layout. The lower left corner of the bounding box is always (0,0), thus this IPoint defines the upper right corner as well as the width and height of the grid layout.
fixEmbedding	determines if the input graph is embedded and that embedding has to be preserved (true), or if an embedding needs to be computed (false).

Implements ogdf::PlanarGridLayoutModule.

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

include/ogdf/planarlayout/FPPLayout.h

OpenGraph DrawingFramework

Public Member Functions

Private Member Functions

Additional Inherited Members