Open
Graph Drawing
Framework

 v.2010.10
 

Public Member Functions | Protected Member Functions | Private Member Functions | Private Attributes

ogdf::ClusterPlanRep Class Reference

#include <ogdf/cluster/ClusterPlanRep.h>

Inheritance diagram for ogdf::ClusterPlanRep:
ogdf::PlanRep ogdf::GraphCopy ogdf::Graph

List of all members.

Public Member Functions

 ClusterPlanRep (const ClusterGraphAttributes &acGraph, const ClusterGraph &clusterGraph)
virtual ~ClusterPlanRep ()
void initCC (int i)
 Initializes the planarized representation for connected component i.
void setClusterBoundary (edge e)
bool isClusterBoundary (edge e)
const ClusterGraphgetClusterGraph () const
void insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
void ModelBoundaries ()
adjEntry externalAdj ()
virtual void expand (bool lowDegreeExpand=false)
virtual void expandLowDegreeVertices (OrthoRep &OR)
virtual edge split (edge e)
 Splits edge e.
cluster clusterOfEdge (edge e)
int ClusterID (node v) const
int ClusterID (edge e) const
cluster clusterOfIndex (int i)
cluster clusterOfDummy (node v)
void writeGML (const char *fileName, const Layout &drawing)
void writeGML (const char *fileName)
void writeGML (ostream &os, const Layout &drawing)

Protected Member Functions

void convertClusterGraph (cluster act, AdjEntryArray< edge > &currentEdge, AdjEntryArray< int > &outEdge)
void insertBoundary (cluster C, AdjEntryArray< edge > &currentEdge, AdjEntryArray< int > &outEdge, bool clusterIsLeaf)
void reinsertEdge (edge e)

Private Member Functions

edgeType clusterPattern ()

Private Attributes

const ClusterGraphm_pClusterGraph
adjEntry m_rootAdj
EdgeArray< int > m_edgeClusterID
NodeArray< int > m_nodeClusterID
HashArray< int, clusterm_clusterOfIndex

Detailed Description

Definition at line 73 of file ClusterPlanRep.h.


Constructor & Destructor Documentation

ogdf::ClusterPlanRep::ClusterPlanRep ( const ClusterGraphAttributes acGraph,
const ClusterGraph clusterGraph 
)
virtual ogdf::ClusterPlanRep::~ClusterPlanRep (  )  [inline, virtual]

Definition at line 81 of file ClusterPlanRep.h.


Member Function Documentation

int ogdf::ClusterPlanRep::ClusterID ( node  v  )  const [inline]

Definition at line 169 of file ClusterPlanRep.h.

int ogdf::ClusterPlanRep::ClusterID ( edge  e  )  const [inline]

Definition at line 170 of file ClusterPlanRep.h.

cluster ogdf::ClusterPlanRep::clusterOfDummy ( node  v  )  [inline]

Definition at line 173 of file ClusterPlanRep.h.

cluster ogdf::ClusterPlanRep::clusterOfEdge ( edge  e  )  [inline]

Definition at line 138 of file ClusterPlanRep.h.

cluster ogdf::ClusterPlanRep::clusterOfIndex ( int  i  )  [inline]

Definition at line 171 of file ClusterPlanRep.h.

edgeType ogdf::ClusterPlanRep::clusterPattern (  )  [inline, private]

Definition at line 206 of file ClusterPlanRep.h.

void ogdf::ClusterPlanRep::convertClusterGraph ( cluster  act,
AdjEntryArray< edge > &  currentEdge,
AdjEntryArray< int > &  outEdge 
) [protected]
virtual void ogdf::ClusterPlanRep::expand ( bool  lowDegreeExpand = false  )  [virtual]

Reimplemented from ogdf::PlanRep.

virtual void ogdf::ClusterPlanRep::expandLowDegreeVertices ( OrthoRep OR  )  [virtual]

Reimplemented from ogdf::PlanRep.

adjEntry ogdf::ClusterPlanRep::externalAdj (  )  [inline]

Definition at line 111 of file ClusterPlanRep.h.

const ClusterGraph& ogdf::ClusterPlanRep::getClusterGraph (  )  const [inline]

Definition at line 92 of file ClusterPlanRep.h.

void ogdf::ClusterPlanRep::initCC ( int  i  ) 

Initializes the planarized representation for connected component i.

This initialization is always required. After performing this initialization, the planarized representation represents a copy of the i-th connected component of the original graph, where connected components are numbered 0,1,2,...

Reimplemented from ogdf::PlanRep.

void ogdf::ClusterPlanRep::insertBoundary ( cluster  C,
AdjEntryArray< edge > &  currentEdge,
AdjEntryArray< int > &  outEdge,
bool  clusterIsLeaf 
) [protected]
void ogdf::ClusterPlanRep::insertEdgePathEmbedded ( edge  eOrig,
CombinatorialEmbedding E,
const SList< adjEntry > &  crossedEdges 
)

re-inserts edge eOrig by "crossing" the edges in crossedEdges; splits each edge in crossedEdges Precond.: eOrig is an edge in the original graph, the edges in crossedEdges are in this graph, cluster boundaries are modelled as edge paths

Parameters:
eOrig,: Original edge to be inserted
crossedEdges,: Edges that are crossed by this insertion
E,: The embedding in which the edge is inserted

Reimplemented from ogdf::PlanRep.

bool ogdf::ClusterPlanRep::isClusterBoundary ( edge  e  )  [inline]

Definition at line 89 of file ClusterPlanRep.h.

void ogdf::ClusterPlanRep::ModelBoundaries (  ) 
void ogdf::ClusterPlanRep::reinsertEdge ( edge  e  )  [protected]
void ogdf::ClusterPlanRep::setClusterBoundary ( edge  e  )  [inline]

Definition at line 86 of file ClusterPlanRep.h.

virtual edge ogdf::ClusterPlanRep::split ( edge  e  )  [inline, virtual]

Splits edge e.

Reimplemented from ogdf::PlanRep.

Definition at line 123 of file ClusterPlanRep.h.

void ogdf::ClusterPlanRep::writeGML ( const char *  fileName,
const Layout drawing 
)
void ogdf::ClusterPlanRep::writeGML ( const char *  fileName  ) 
void ogdf::ClusterPlanRep::writeGML ( ostream &  os,
const Layout drawing 
)

Member Data Documentation

Definition at line 217 of file ClusterPlanRep.h.

Definition at line 213 of file ClusterPlanRep.h.

Definition at line 214 of file ClusterPlanRep.h.

Definition at line 204 of file ClusterPlanRep.h.

Definition at line 208 of file ClusterPlanRep.h.


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