Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files
 

Loading...
Searching...
No Matches
Public Member Functions | Private Member Functions | Private Attributes | List of all members
ogdf::BitonicOrdering Class Reference

#include <ogdf/planarlayout/BitonicOrdering.h>

Public Member Functions

 BitonicOrdering (Graph &G, adjEntry adj_st_edge)
 
int getIndex (node v) const
 
node getNode (int i) const
 

Private Member Functions

void assignLabel (node v_T, node v)
 
adjEntry getAdjST (node v_T) const
 
int getLabel (node v_T, node v) const
 
void handleCase (node v_T)
 
void handleParallelCase (node v_T)
 
void handleRigidCase (node v_T)
 
void handleSerialCase (node v_T)
 
bool isFlipped (node v_T) const
 
void partitionToOrderIndices (const List< List< node > > &partitionlist, NodeArray< int > &indices, Array< node > &vertices) const
 
void setFlipped (node v_T, bool flag)
 

Private Attributes

int m_currLabel
 
NodeArray< bool > m_flipped
 
Graph & m_graph
 
Array< node > m_indexToNode
 
NodeArray< int > m_orderIndex
 
StaticPlanarSPQRTree m_tree
 

Detailed Description

Definition at line 45 of file BitonicOrdering.h.

Constructor & Destructor Documentation

◆ BitonicOrdering()

ogdf::BitonicOrdering::BitonicOrdering ( Graph &  G,
adjEntry  adj_st_edge 
)

Member Function Documentation

◆ assignLabel()

void ogdf::BitonicOrdering::assignLabel ( node  v_T,
node  v 
)
inlineprivate

Definition at line 85 of file BitonicOrdering.h.

◆ getAdjST()

adjEntry ogdf::BitonicOrdering::getAdjST ( node  v_T) const
private

◆ getIndex()

int ogdf::BitonicOrdering::getIndex ( node  v) const
inline

Definition at line 57 of file BitonicOrdering.h.

◆ getLabel()

int ogdf::BitonicOrdering::getLabel ( node  v_T,
node  v 
) const
inlineprivate

Definition at line 97 of file BitonicOrdering.h.

◆ getNode()

node ogdf::BitonicOrdering::getNode ( int  i) const
inline

Definition at line 60 of file BitonicOrdering.h.

◆ handleCase()

void ogdf::BitonicOrdering::handleCase ( node  v_T)
private

◆ handleParallelCase()

void ogdf::BitonicOrdering::handleParallelCase ( node  v_T)
private

◆ handleRigidCase()

void ogdf::BitonicOrdering::handleRigidCase ( node  v_T)
private

◆ handleSerialCase()

void ogdf::BitonicOrdering::handleSerialCase ( node  v_T)
private

◆ isFlipped()

bool ogdf::BitonicOrdering::isFlipped ( node  v_T) const
inlineprivate

Definition at line 109 of file BitonicOrdering.h.

◆ partitionToOrderIndices()

void ogdf::BitonicOrdering::partitionToOrderIndices ( const List< List< node > > &  partitionlist,
NodeArray< int > &  indices,
Array< node > &  vertices 
) const
private

◆ setFlipped()

void ogdf::BitonicOrdering::setFlipped ( node  v_T,
bool  flag 
)
inlineprivate

Definition at line 106 of file BitonicOrdering.h.

Member Data Documentation

◆ m_currLabel

int ogdf::BitonicOrdering::m_currLabel
private

Definition at line 115 of file BitonicOrdering.h.

◆ m_flipped

NodeArray<bool> ogdf::BitonicOrdering::m_flipped
private

Definition at line 124 of file BitonicOrdering.h.

◆ m_graph

Graph& ogdf::BitonicOrdering::m_graph
private

Definition at line 112 of file BitonicOrdering.h.

◆ m_indexToNode

Array<node> ogdf::BitonicOrdering::m_indexToNode
private

Definition at line 121 of file BitonicOrdering.h.

◆ m_orderIndex

NodeArray<int> ogdf::BitonicOrdering::m_orderIndex
private

Definition at line 118 of file BitonicOrdering.h.

◆ m_tree

StaticPlanarSPQRTree ogdf::BitonicOrdering::m_tree
private

Definition at line 127 of file BitonicOrdering.h.

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