#include <ogdf/internal/planarity/EmbedderMaxFaceBiconnectedGraphsLayers.h>
Public Member Functions | |
| EmbedderMaxFaceBiconnectedGraphsLayers () | |
| Creates an embedder. | |
Static Public Member Functions | |
| static void | embed (Graph &G, adjEntry &adjExternal, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength, const node &n=0) |
| Embeds G by computing and extending a maximum face in G containg n. | |
| static void | compute (const Graph &G, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength, StaticSPQRTree &spqrTree, NodeArray< EdgeArray< T > > &edgeLengthSkel) |
| Computes the component lengths of all virtual edges in spqrTree. | |
| static T | computeSize (const Graph &G, const node &n, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength) |
| Returns the size of a maximum external face in G containing the node n. | |
| static T | computeSize (const Graph &G, const node &n, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength, StaticSPQRTree &spqrTree) |
| Returns the size of a maximum external face in G containing the node n. | |
| static T | computeSize (const Graph &G, const node &n, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength, StaticSPQRTree &spqrTree, const NodeArray< EdgeArray< T > > &edgeLengthSkel) |
| Returns the size of a maximum external face in G containing the node n. | |
| static T | computeSize (const Graph &G, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength) |
| Returns the size of a maximum external face in G. | |
| static T | computeSize (const Graph &G, const NodeArray< T > &nodeLength, const EdgeArray< T > &edgeLength, StaticSPQRTree &spqrTree, NodeArray< EdgeArray< T > > &edgeLengthSkel) |
| Returns the size of a maximum external face in G. The SPQR-tree is given. The computed component lengths are computed and returned. | |
Static Private Member Functions | |
| static void | bottomUpTraversal (StaticSPQRTree &spqrTree, const node &mu, const NodeArray< T > &nodeLength, NodeArray< EdgeArray< T > > &edgeLength) |
| Bottom up traversal of SPQR-tree computing the component length of all non-reference edges. | |
| static void | topDownTraversal (StaticSPQRTree &spqrTree, const node &mu, const NodeArray< T > &nodeLength, NodeArray< EdgeArray< T > > &edgeLength) |
| Top down traversal of SPQR-tree computing the component length of all reference edges. | |
| static T | largestFaceContainingNode (const StaticSPQRTree &spqrTree, const node &mu, const node &n, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength) |
| Computes the size of a maximum face in the skeleton graph of mu containing n. | |
| static T | largestFaceInSkeleton (const StaticSPQRTree &spqrTree, const node &mu, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength) |
| Computes the size of a maximum face in the skeleton graph of mu. | |
| static void | bottomUpThickness (const StaticSPQRTree &spqrTree, const node &mu, NodeArray< T > &thickness, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength) |
| static void | expandEdge (const StaticSPQRTree &spqrTree, NodeArray< bool > &treeNodeTreated, const node &mu, const node &leftNode, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength, const NodeArray< T > &thickness, NodeArray< List< adjEntry > > &newOrder, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArraySource, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArrayTarget, const T &delta_u, const T &delta_d, adjEntry &adjExternal, const node &n=0) |
| static void | expandEdgeSNode (const StaticSPQRTree &spqrTree, NodeArray< bool > &treeNodeTreated, const node &mu, const node &leftNode, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength, const NodeArray< T > &thickness, NodeArray< List< adjEntry > > &newOrder, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArraySource, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArrayTarget, const T &delta_u, const T &delta_d, adjEntry &adjExternal) |
| static void | expandEdgePNode (const StaticSPQRTree &spqrTree, NodeArray< bool > &treeNodeTreated, const node &mu, const node &leftNode, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength, const NodeArray< T > &thickness, NodeArray< List< adjEntry > > &newOrder, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArraySource, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArrayTarget, const T &delta_u, const T &delta_d, adjEntry &adjExternal) |
| static void | expandEdgeRNode (const StaticSPQRTree &spqrTree, NodeArray< bool > &treeNodeTreated, const node &mu, const node &leftNode, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength, const NodeArray< T > &thickness, NodeArray< List< adjEntry > > &newOrder, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArraySource, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArrayTarget, const T &delta_u, const T &delta_d, adjEntry &adjExternal, const node &n=0) |
| static void | adjEntryForNode (adjEntry &ae, ListIterator< adjEntry > &before, const StaticSPQRTree &spqrTree, NodeArray< bool > &treeNodeTreated, const node &mu, const node &leftNode, const NodeArray< T > &nodeLength, const NodeArray< EdgeArray< T > > &edgeLength, const NodeArray< T > &thickness, NodeArray< List< adjEntry > > &newOrder, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArraySource, NodeArray< ListIterator< adjEntry > > &adjBeforeNodeArrayTarget, const T &delta_u, const T &delta_d, adjEntry &adjExternal) |
| static bool | sssp (const Graph &G, const node &s, const EdgeArray< T > &length, NodeArray< T > &d) |
Definition at line 66 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::EmbedderMaxFaceBiconnectedGraphsLayers | ( | ) | [inline] |
Creates an embedder.
Definition at line 70 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::adjEntryForNode | ( | adjEntry & | ae, |
| ListIterator< adjEntry > & | before, | ||
| const StaticSPQRTree & | spqrTree, | ||
| NodeArray< bool > & | treeNodeTreated, | ||
| const node & | mu, | ||
| const node & | leftNode, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength, | ||
| const NodeArray< T > & | thickness, | ||
| NodeArray< List< adjEntry > > & | newOrder, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArraySource, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArrayTarget, | ||
| const T & | delta_u, | ||
| const T & | delta_d, | ||
| adjEntry & | adjExternal | ||
| ) | [static, private] |
(ae->theEdge() == referenceEdge)
(S.isVirtual(ae->theEdge()))
Definition at line 628 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::bottomUpThickness | ( | const StaticSPQRTree & | spqrTree, |
| const node & | mu, | ||
| NodeArray< T > & | thickness, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength | ||
| ) | [static, private] |
Definition at line 2372 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::bottomUpTraversal | ( | StaticSPQRTree & | spqrTree, |
| const node & | mu, | ||
| const NodeArray< T > & | nodeLength, | ||
| NodeArray< EdgeArray< T > > & | edgeLength | ||
| ) | [static, private] |
Bottom up traversal of SPQR-tree computing the component length of all non-reference edges.
| spqrTree | is the SPQR-tree of G. |
| mu | is the SPQR-tree node treated in this function call. |
| nodeLength | is saving for each node of the original graph G its length. |
| edgeLength | is saving for each skeleton graph the length of each edge. |
Definition at line 1983 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::compute | ( | const Graph & | G, |
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength, | ||
| StaticSPQRTree & | spqrTree, | ||
| NodeArray< EdgeArray< T > > & | edgeLengthSkel | ||
| ) | [static] |
Computes the component lengths of all virtual edges in spqrTree.
| G | is the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
| spqrTree | is the SPQR-tree of G. |
| edgeLengthSkel | is saving for each skeleton graph of the SPQR-tree all edge lengths. |
Definition at line 1783 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::computeSize | ( | const Graph & | G, |
| const node & | n, | ||
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength | ||
| ) | [static] |
Returns the size of a maximum external face in G containing the node n.
| G | is the original graph. |
| n | is a node of the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
Definition at line 1893 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::computeSize | ( | const Graph & | G, |
| const node & | n, | ||
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength, | ||
| StaticSPQRTree & | spqrTree | ||
| ) | [static] |
Returns the size of a maximum external face in G containing the node n.
| G | is the original graph. |
| n | is a node of the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
| spqrTree | is the SPQR-tree of G. |
Definition at line 1917 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::computeSize | ( | const Graph & | G, |
| const node & | n, | ||
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength, | ||
| StaticSPQRTree & | spqrTree, | ||
| const NodeArray< EdgeArray< T > > & | edgeLengthSkel | ||
| ) | [static] |
Returns the size of a maximum external face in G containing the node n.
| G | is the original graph. |
| n | is a node of the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
| spqrTree | is the SPQR-tree of G. |
| edgeLengthSkel | is saving for each skeleton graph the length of each edge. |
Definition at line 1930 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::computeSize | ( | const Graph & | G, |
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength | ||
| ) | [static] |
Returns the size of a maximum external face in G.
| G | is the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
Definition at line 1818 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::computeSize | ( | const Graph & | G, |
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength, | ||
| StaticSPQRTree & | spqrTree, | ||
| NodeArray< EdgeArray< T > > & | edgeLengthSkel | ||
| ) | [static] |
Returns the size of a maximum external face in G. The SPQR-tree is given. The computed component lengths are computed and returned.
| G | is the original graph. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
| spqrTree | is the SPQR-tree of G. |
| edgeLengthSkel | is saving for each skeleton graph the length of each edge. |
Definition at line 1839 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::embed | ( | Graph & | G, |
| adjEntry & | adjExternal, | ||
| const NodeArray< T > & | nodeLength, | ||
| const EdgeArray< T > & | edgeLength, | ||
| const node & | n = 0 |
||
| ) | [static] |
Embeds G by computing and extending a maximum face in G containg n.
| G | is the original graph. |
| return | adjExternal is an adjacency entry of the external face. |
| nodeLength | is saving for each vertex in G its length. |
| edgeLength | is saving for each edge in G its length. |
| n | is a node of the original graph. If n is given, a maximum face containing n is computed, otherwise any maximum face. |
Definition at line 518 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::expandEdge | ( | const StaticSPQRTree & | spqrTree, |
| NodeArray< bool > & | treeNodeTreated, | ||
| const node & | mu, | ||
| const node & | leftNode, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength, | ||
| const NodeArray< T > & | thickness, | ||
| NodeArray< List< adjEntry > > & | newOrder, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArraySource, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArrayTarget, | ||
| const T & | delta_u, | ||
| const T & | delta_d, | ||
| adjEntry & | adjExternal, | ||
| const node & | n = 0 |
||
| ) | [static, private] |
Definition at line 719 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::expandEdgePNode | ( | const StaticSPQRTree & | spqrTree, |
| NodeArray< bool > & | treeNodeTreated, | ||
| const node & | mu, | ||
| const node & | leftNode, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength, | ||
| const NodeArray< T > & | thickness, | ||
| NodeArray< List< adjEntry > > & | newOrder, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArraySource, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArrayTarget, | ||
| const T & | delta_u, | ||
| const T & | delta_d, | ||
| adjEntry & | adjExternal | ||
| ) | [static, private] |
(S.isVirtual(e))
(delta_u + sum_E_a <= delta_d + sum_E_b)
Definition at line 888 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::expandEdgeRNode | ( | const StaticSPQRTree & | spqrTree, |
| NodeArray< bool > & | treeNodeTreated, | ||
| const node & | mu, | ||
| const node & | leftNode, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength, | ||
| const NodeArray< T > & | thickness, | ||
| NodeArray< List< adjEntry > > & | newOrder, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArraySource, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArrayTarget, | ||
| const T & | delta_u, | ||
| const T & | delta_d, | ||
| adjEntry & | adjExternal, | ||
| const node & | n = 0 |
||
| ) | [static, private] |
Definition at line 1191 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::expandEdgeSNode | ( | const StaticSPQRTree & | spqrTree, |
| NodeArray< bool > & | treeNodeTreated, | ||
| const node & | mu, | ||
| const node & | leftNode, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength, | ||
| const NodeArray< T > & | thickness, | ||
| NodeArray< List< adjEntry > > & | newOrder, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArraySource, | ||
| NodeArray< ListIterator< adjEntry > > & | adjBeforeNodeArrayTarget, | ||
| const T & | delta_u, | ||
| const T & | delta_d, | ||
| adjEntry & | adjExternal | ||
| ) | [static, private] |
Definition at line 759 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::largestFaceContainingNode | ( | const StaticSPQRTree & | spqrTree, |
| const node & | mu, | ||
| const node & | n, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength | ||
| ) | [static, private] |
Computes the size of a maximum face in the skeleton graph of mu containing n.
| spqrTree | is the SPQR-tree of G. |
| mu | is the SPQR-tree node treated in this function call. |
| n | is a node of the original graph G. |
| nodeLength | is saving for each node of the original graph G its length. |
| edgeLength | is saving for each skeleton graph the length of each edge. |
Definition at line 2171 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| T ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::largestFaceInSkeleton | ( | const StaticSPQRTree & | spqrTree, |
| const node & | mu, | ||
| const NodeArray< T > & | nodeLength, | ||
| const NodeArray< EdgeArray< T > > & | edgeLength | ||
| ) | [static, private] |
Computes the size of a maximum face in the skeleton graph of mu.
| spqrTree | is the SPQR-tree of G. |
| mu | is the SPQR-tree node treated in this function call. |
| nodeLength | is saving for each node of the original graph G its length. |
| edgeLength | is saving for each skeleton graph the length of each edge. |
Definition at line 2273 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| bool ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::sssp | ( | const Graph & | G, |
| const node & | s, | ||
| const EdgeArray< T > & | length, | ||
| NodeArray< T > & | d | ||
| ) | [static, private] |
Definition at line 2628 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.
| void ogdf::EmbedderMaxFaceBiconnectedGraphsLayers< T >::topDownTraversal | ( | StaticSPQRTree & | spqrTree, |
| const node & | mu, | ||
| const NodeArray< T > & | nodeLength, | ||
| NodeArray< EdgeArray< T > > & | edgeLength | ||
| ) | [static, private] |
Top down traversal of SPQR-tree computing the component length of all reference edges.
| spqrTree | is the SPQR-tree of G. |
| mu | is the SPQR-tree node treated in this function call. |
| nodeLength | is saving for each node of the original graph G its length. |
| edgeLength | is saving for each skeleton graph the length of each edge. |
Definition at line 2078 of file EmbedderMaxFaceBiconnectedGraphsLayers.h.