Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::CompactionConstraintGraph< ATYPE > Class Template Reference

Represents a constraint graph used for compaction. More...

#include <ogdf/orthogonal/CompactionConstraintGraph.h>

+ Inheritance diagram for ogdf::CompactionConstraintGraph< ATYPE >:

Classes

struct  Interval
 Represents an interval on the sweep line. More...
 
class  SegmentComparer
 Comparer class used for sorting segments by increasing position (given by segPos) such that two overlapping segments come in the order imposed by the embedding (given by secSort: segment which comes first has secSort = 0, the other has 1) More...
 

Public Member Functions

 CompactionConstraintGraph (const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, ATYPE sep, int costGen=1, int costAssoc=1, bool align=false)
 Construction. More...
 
bool areMulti (edge e1, edge e2) const
 Return PG result for flowcompaction. More...
 
bool centerPriority ()
 Gets centerPriority (center single edges?) More...
 
void centerPriority (bool b)
 Sets centerPriority (center single edges?) More...
 
ATYPE computeTotalCosts (const NodeArray< ATYPE > &pos) const
 Computes the total costs for coordintes given by pos, i.e., the sum of the weighted lengths of edges in the constraint graph. More...
 
ATYPE extraOfs (node v) const
 Returns extraNode position, change to save mem, only need some entries. More...
 
void insertVertexSizeArcs (const PlanRep &PG, const NodeArray< ATYPE > &sizeOrig, const MinimumEdgeDistances< ATYPE > &minDist)
 Inserts arcs for respecting sizes of vertices and achieving desired placement of generalizations if vertices are represented by tight cages. Also corrects length of arcs belonging to cages which are adjacent to a corner; takes special distances between edge segments attached at a vertex (delta's and epsilon's) into account. More...
 
void insertVertexSizeArcs (const PlanRep &PG, const NodeArray< ATYPE > &sizeOrig, const RoutingChannel< ATYPE > &rc)
 Inserts arcs for respecting sizes of vertices and achieving desired placement of generalizations if vertices are represented by variable cages; also corrects length of arcs belonging to cages which are adjacent to a corner; takes routing channels into account. More...
 
void insertVisibilityArcs (const PlanRep &PG, const NodeArray< ATYPE > &posDir, const NodeArray< ATYPE > &posOppDir)
 Inserts arcs connecting segments which can see each other in a drawing of the associated planarized representation PG which is given by posDir and posOppDir. More...
 
void insertVisibilityArcs (const PlanRep &PG, const NodeArray< ATYPE > &posDir, const NodeArray< ATYPE > &posOrthDir, const MinimumEdgeDistances< ATYPE > &minDist)
 
bool isFeasible (const NodeArray< ATYPE > &pos)
 Performs feasibility test for position assignment pos, i.e., checks if the segment positions given by pos fulfill the constraints in the compaction constraint graph (for debuging only) More...
 
ATYPE length (edge e) const
 Returns length of edge e. More...
 
ATYPE separation () const
 Returns the separation value. More...
 
void setMinimumSeparation (const PlanRep &PG, const NodeArray< int > &coord, const MinimumEdgeDistances< ATYPE > &minDist)
 Sets min separation for multi edge original. More...
 
- Public Member Functions inherited from ogdf::CompactionConstraintGraphBase
void align (bool b)
 Triggers alignment (=>some special edge handling to support al.) More...
 
bool alignmentArc (edge e) const
 Returns if arc is important for alignment. These are the arcs representing node to gen. merger edges. More...
 
edge pathToOriginal (node v)
 
bool verticalGen (edge e) const
 Returns true if e is vertical edge in PlanRepUML hierarchy. More...
 
bool verticalArc (edge e) const
 Returns true if e is basic arc of vertical edge in PlanRepUML hierarchy. More...
 
- Public Member Functions inherited from ogdf::CommonCompactionConstraintGraphBase
edge basicArc (edge e) const
 Returns constraint arc representing input edge e in constraint graph. More...
 
void computeTopologicalSegmentNum (NodeArray< int > &topNum)
 Computes topological numbering on the segments of the constraint graph. More...
 
void embed ()
 Embeds constraint graph such that all sources and sinks lie in a common face. More...
 
bool extraNode (node v) const
 Returns node status. More...
 
void removeRedundantVisibArcs (SListPure< Tuple2< node, node >> &visibArcs)
 Removes "arcs" from visibArcs which we already have in the constraint graph (as basic arcs) More...
 
ConstraintEdgeType typeOf (edge e) const
 Returns type of edge e. More...
 
const GraphgetGraph () const
 Returns underlying graph. More...
 
GraphgetGraph ()
 
const OrthoRepgetOrthoRep () const
 Returns underlying OrthoRep. More...
 
const PlanRepgetPlanRep () const
 
const SListPure< node > & nodesIn (node v) const
 Returns list of nodes contained in segment v. More...
 
node pathNodeOf (node v) const
 Returns the segment (path node in constraint graph) containing v. More...
 
int cost (edge e) const
 Returns cost of edge e. More...
 
node extraRep (node v) const
 Returns extraNode existing anchor representant. More...
 
bool onBorder (edge e) const
 Returns true if edge lies on cage border. More...
 
bool fixOnBorder (edge e) const
 Returns true if edge is subject to length fixation if length < sep. More...
 

Protected Member Functions

void initializeCosts ()
 
void setExtra (node v, node rep, ATYPE ofs)
 Node v has no representation in drawing, only internal representation. More...
 
- Protected Member Functions inherited from ogdf::CompactionConstraintGraphBase
 CompactionConstraintGraphBase (const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, int costGen=1, int costAssoc=1, bool align=false)
 Construction. More...
 
- Protected Member Functions inherited from ogdf::CommonCompactionConstraintGraphBase
 CommonCompactionConstraintGraphBase (const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, int costAssoc)
 Build constraint graph with basic arcs. More...
 
- Protected Member Functions inherited from ogdf::Graph
void construct (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void assign (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void constructInitByNodes (const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 Constructs a copy of the subgraph of G induced by nodeList. More...
 
void constructInitByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void constructInitByCC (const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 Constructs a copy of connected component cc in info. More...
 
bool empty () const
 Returns true iff the graph is empty, i.e., contains no nodes. More...
 
int numberOfNodes () const
 Returns the number of nodes in the graph. More...
 
int numberOfEdges () const
 Returns the number of edges in the graph. More...
 
int maxNodeIndex () const
 Returns the largest used node index. More...
 
int maxEdgeIndex () const
 Returns the largest used edge index. More...
 
int maxAdjEntryIndex () const
 Returns the largest used adjEntry index. More...
 
int nodeArrayTableSize () const
 Returns the table size of node arrays associated with this graph. More...
 
int edgeArrayTableSize () const
 Returns the table size of edge arrays associated with this graph. More...
 
int adjEntryArrayTableSize () const
 Returns the table size of adjEntry arrays associated with this graph. More...
 
node firstNode () const
 Returns the first node in the list of all nodes. More...
 
node lastNode () const
 Returns the last node in the list of all nodes. More...
 
edge firstEdge () const
 Returns the first edge in the list of all edges. More...
 
edge lastEdge () const
 Returns the last edge in the list of all edges. More...
 
node chooseNode (std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const
 Returns a random node. More...
 
edge chooseEdge (std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const
 Returns a random edge. More...
 
template<class CONTAINER >
void allNodes (CONTAINER &nodeContainer) const
 Returns a container with all nodes of the graph. More...
 
template<class CONTAINER >
void allEdges (CONTAINER &edgeContainer) const
 Returns a container with all edges of the graph. More...
 
node newNode ()
 Creates a new node and returns it. More...
 
node newNode (int index)
 Creates a new node with predefined index and returns it. More...
 
edge newEdge (node v, node w)
 Creates a new edge (v,w) and returns it. More...
 
edge newEdge (node v, node w, int index)
 Creates a new edge (v,w) with predefined index and returns it. More...
 
edge newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, adjEntry adjTgt)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (adjEntry adjSrc, node w)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
virtual void delNode (node v)
 Removes node v and all incident edges from the graph. More...
 
virtual void delEdge (edge e)
 Removes edge e from the graph. More...
 
virtual void clear ()
 Removes all nodes and all edges from the graph. More...
 
void insert (const Graph &G, NodeArray< node > &nodeMap)
 Inserts Graph G as a subgraph into this Graph. More...
 
void insert (const Graph &G)
 Inserts Graph G as a subgraph into this Graph. More...
 
virtual edge split (edge e)
 Splits edge e into two edges introducing a new node. More...
 
void unsplit (node u)
 Undoes a split operation. More...
 
virtual void unsplit (edge eIn, edge eOut)
 Undoes a split operation. More...
 
node splitNode (adjEntry adjStartLeft, adjEntry adjStartRight)
 Splits a node while preserving the order of adjacency entries. More...
 
node contract (edge e, bool keepSelfLoops=false)
 Contracts edge e while preserving the order of adjacency entries. More...
 
void move (edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)
 Moves edge e to a different adjacency list. More...
 
void moveTarget (edge e, node w)
 Moves the target node of edge e to node w. More...
 
void moveTarget (edge e, adjEntry adjTgt, Direction dir)
 Moves the target node of edge e to a specific position in an adjacency list. More...
 
void moveSource (edge e, node w)
 Moves the source node of edge e to node w. More...
 
void moveSource (edge e, adjEntry adjSrc, Direction dir)
 Moves the source node of edge e to a specific position in an adjacency list. More...
 
edge searchEdge (node v, node w, bool directed=false) const
 Searches and returns an edge connecting nodes v and w in time O( min(deg(v ), deg(w ))). More...
 
void reverseEdge (edge e)
 Reverses the edge e, i.e., exchanges source and target node. More...
 
void reverseAllEdges ()
 Reverses all edges in the graph. More...
 
template<class NODELIST >
void collapse (NODELIST &nodesToCollapse)
 Collapses all nodes in the list nodesToCollapse to the first node in the list. More...
 
template<class ADJ_ENTRY_LIST >
void sort (node v, const ADJ_ENTRY_LIST &newOrder)
 Sorts the adjacency list of node v according to newOrder. More...
 
void reverseAdjEdges (node v)
 Reverses the adjacency list of v. More...
 
void moveAdj (adjEntry adjMove, Direction dir, adjEntry adjPos)
 Moves adjacency entry adjMove before or after adjPos. More...
 
void moveAdjAfter (adjEntry adjMove, adjEntry adjAfter)
 Moves adjacency entry adjMove after adjAfter. More...
 
void moveAdjBefore (adjEntry adjMove, adjEntry adjBefore)
 Moves adjacency entry adjMove before adjBefore. More...
 
void reverseAdjEdges ()
 Reverses all adjacency lists. More...
 
void swapAdjEdges (adjEntry adj1, adjEntry adj2)
 Exchanges two entries in an adjacency list. More...
 
int genus () const
 Returns the genus of the graph's embedding. More...
 
bool representsCombEmbedding () const
 Returns true iff the graph represents a combinatorial embedding. More...
 
ListIterator< NodeArrayBase * > registerArray (NodeArrayBase *pNodeArray) const
 Registers a node array. More...
 
ListIterator< EdgeArrayBase * > registerArray (EdgeArrayBase *pEdgeArray) const
 Registers an edge array. More...
 
ListIterator< AdjEntryArrayBase * > registerArray (AdjEntryArrayBase *pAdjArray) const
 Registers an adjEntry array. More...
 
ListIterator< GraphObserver * > registerStructure (GraphObserver *pStructure) const
 Registers a graph observer (e.g. a ClusterGraph). More...
 
void unregisterArray (ListIterator< NodeArrayBase * > it) const
 Unregisters a node array. More...
 
void unregisterArray (ListIterator< EdgeArrayBase * > it) const
 Unregisters an edge array. More...
 
void unregisterArray (ListIterator< AdjEntryArrayBase * > it) const
 Unregisters an adjEntry array. More...
 
void unregisterStructure (ListIterator< GraphObserver * > it) const
 Unregisters a graph observer. More...
 
template<class ArrayBase >
void moveRegisterArray (ListIterator< ArrayBase * > it, ArrayBase *pArray) const
 Move the registration it of an graph element array to pArray (used with move semantics for graph element arrays). More...
 
void resetEdgeIdCount (int maxId)
 Resets the edge id count to maxId. More...
 
 Graph ()
 Constructs an empty graph. More...
 
 Graph (const Graph &G)
 Constructs a graph that is a copy of G. More...
 
virtual ~Graph ()
 Destructor. More...
 
Graphoperator= (const Graph &G)
 Assignment operator. More...
 

Private Member Functions

bool checkSweepLine (const List< Interval > &sweepLine) const
 
virtual string getLengthString (edge e) const override
 
void resetGenMergerLengths (const PlanRep &PG, adjEntry adjFirst)
 
void setBasicArcsZeroLength (const PlanRep &PG)
 
void setBoundaryCosts (adjEntry cornerDir, adjEntry cornerOppDir)
 

Private Attributes

NodeArray< ATYPE > m_extraOfs
 offset of extra node to its rep, should change this More...
 
EdgeArray< ATYPE > m_length
 length of an edge More...
 
ATYPE m_sep
 

Cost settings

int m_vertexArcCost
 get small cages More...
 
int m_bungeeCost
 middle position distance penalty More...
 
int m_MedianArcCost
 draw merger gen at median of incoming generalizations More...
 
int m_doubleBendCost
 try to minimize double bends More...
 
bool m_genToMedian
 draw outgoing generalization from merger above ingoing gen. More...
 
bool m_centerPriority
 should centering be more expensive than generalizations More...
 
static const int c_vertexArcFactor = 20
 
static const int c_bungeeFactor = 20
 
static const int c_doubleBendFactor = 20
 double bends cost factor*vertexArcCost More...
 
static const int c_MedianFactor = 10*c_doubleBendFactor
 median arcs cost factor*vertexArcCost More...
 

Additional Inherited Members

- Protected Types inherited from ogdf::Graph
enum  EdgeType { EdgeType::association = 0, EdgeType::generalization = 1, EdgeType::dependency = 2 }
 The type of edges (only used in derived classes). More...
 
enum  NodeType { NodeType::vertex = 0, NodeType::dummy = 1, NodeType::generalizationMerger = 2, NodeType::generalizationExpander = 3, NodeType::highDegreeExpander = 4, NodeType::lowDegreeExpander = 5, NodeType::associationClass = 6 }
 The type of nodes. More...
 
using node_iterator = internal::GraphIterator< node >
 Provides a bidirectional iterator to a node in a graph. More...
 
using edge_iterator = internal::GraphIterator< edge >
 Provides a bidirectional iterator to an edge in a graph. More...
 
using adjEntry_iterator = internal::GraphIterator< adjEntry >
 Provides a bidirectional iterator to an entry in an adjacency list. More...
 
- Protected Attributes inherited from ogdf::CompactionConstraintGraphBase
EdgeArray< bool > m_alignmentArc
 Basic arcs that have to be short for alignment (node to gen expander) More...
 
int m_edgeCost [2]
 
NodeArray< edgem_pathToEdge
 save the (single!) edge (segment) for a pathNode More...
 
EdgeArray< bool > m_verticalArc
 arc corresponding to such an edge More...
 
EdgeArray< bool > m_verticalGen
 generalization that runs vertical relative to hierarchy More...
 
- Protected Attributes inherited from ogdf::CommonCompactionConstraintGraphBase
OrthoDir m_arcDir
 
EdgeArray< int > m_border
 only used for cage precompaction in flowcompaction computecoords More...
 
EdgeArray< int > m_cost
 cost of an edge More...
 
EdgeArray< edgem_edgeToBasicArc
 basic arc representing an edge in PG More...
 
NodeArray< bool > m_extraNode
 Node does not represent drawing node as we dont have positions we save a drawing representant and an offset. More...
 
NodeArray< nodem_extraRep
 existing representant of extranodes position anchor More...
 
OrthoDir m_oppArcDir
 
NodeArray< edgem_originalEdge
 save edge for the basic arcs More...
 
NodeArray< SListPure< node > > m_path
 list of nodes contained in a segment More...
 
NodeArray< nodem_pathNode
 segment containing a node in PG More...
 
const OrthoRepm_pOR
 
const PlanRepm_pPR
 
SList< nodem_sinks
 
SList< nodem_sources
 
EdgeArray< ConstraintEdgeTypem_type
 constraint type for each edge More...
 
- Protected Attributes inherited from ogdf::Graph
internal::GraphObjectContainer< NodeElementnodes
 The container containing all node objects. More...
 
internal::GraphObjectContainer< EdgeElementedges
 The container containing all edge objects. More...
 

Detailed Description

template<class ATYPE>
class ogdf::CompactionConstraintGraph< ATYPE >

Represents a constraint graph used for compaction.

  • Vertices: maximally connected horiz. (resp. vert.) paths.
  • Basic arcs: paths connected by edges of opposite direction.
  • Vertex size arcs: care for minimum size of cages.
  • Visibility arcs: paths seeing each other.

Each edge has a (minimum) length and cost.

Definition at line 114 of file CompactionConstraintGraph.h.

Constructor & Destructor Documentation

◆ CompactionConstraintGraph()

template<class ATYPE >
ogdf::CompactionConstraintGraph< ATYPE >::CompactionConstraintGraph ( const OrthoRep OR,
const PlanRep PG,
OrthoDir  arcDir,
ATYPE  sep,
int  costGen = 1,
int  costAssoc = 1,
bool  align = false 
)
inline

Construction.

Definition at line 118 of file CompactionConstraintGraph.h.

Member Function Documentation

◆ areMulti()

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::areMulti ( edge  e1,
edge  e2 
) const

Return PG result for flowcompaction.

◆ centerPriority() [1/2]

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::centerPriority ( )
inline

Gets centerPriority (center single edges?)

Definition at line 153 of file CompactionConstraintGraph.h.

◆ centerPriority() [2/2]

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::centerPriority ( bool  b)
inline

Sets centerPriority (center single edges?)

Definition at line 155 of file CompactionConstraintGraph.h.

◆ checkSweepLine()

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::checkSweepLine ( const List< Interval > &  sweepLine) const
private

Definition at line 915 of file CompactionConstraintGraph.h.

◆ computeTotalCosts()

template<class ATYPE >
ATYPE ogdf::CompactionConstraintGraph< ATYPE >::computeTotalCosts ( const NodeArray< ATYPE > &  pos) const

Computes the total costs for coordintes given by pos, i.e., the sum of the weighted lengths of edges in the constraint graph.

Definition at line 898 of file CompactionConstraintGraph.h.

◆ extraOfs()

template<class ATYPE >
ATYPE ogdf::CompactionConstraintGraph< ATYPE >::extraOfs ( node  v) const
inline

Returns extraNode position, change to save mem, only need some entries.

Definition at line 148 of file CompactionConstraintGraph.h.

◆ getLengthString()

template<class ATYPE >
virtual string ogdf::CompactionConstraintGraph< ATYPE >::getLengthString ( edge  e) const
inlineoverrideprivatevirtual

◆ initializeCosts()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::initializeCosts ( )
inlineprotected

Definition at line 311 of file CompactionConstraintGraph.h.

◆ insertVertexSizeArcs() [1/2]

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::insertVertexSizeArcs ( const PlanRep PG,
const NodeArray< ATYPE > &  sizeOrig,
const MinimumEdgeDistances< ATYPE > &  minDist 
)

Inserts arcs for respecting sizes of vertices and achieving desired placement of generalizations if vertices are represented by tight cages. Also corrects length of arcs belonging to cages which are adjacent to a corner; takes special distances between edge segments attached at a vertex (delta's and epsilon's) into account.

Definition at line 604 of file CompactionConstraintGraph.h.

◆ insertVertexSizeArcs() [2/2]

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::insertVertexSizeArcs ( const PlanRep PG,
const NodeArray< ATYPE > &  sizeOrig,
const RoutingChannel< ATYPE > &  rc 
)

Inserts arcs for respecting sizes of vertices and achieving desired placement of generalizations if vertices are represented by variable cages; also corrects length of arcs belonging to cages which are adjacent to a corner; takes routing channels into account.

Definition at line 460 of file CompactionConstraintGraph.h.

◆ insertVisibilityArcs() [1/2]

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::insertVisibilityArcs ( const PlanRep PG,
const NodeArray< ATYPE > &  posDir,
const NodeArray< ATYPE > &  posOppDir 
)

Inserts arcs connecting segments which can see each other in a drawing of the associated planarized representation PG which is given by posDir and posOppDir.

Parameters
PGassociated planarized representation
posDirposition of segment containing vertex in PG
posOppDirposition of orthogonal segment containing vertex in PG

Definition at line 940 of file CompactionConstraintGraph.h.

◆ insertVisibilityArcs() [2/2]

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::insertVisibilityArcs ( const PlanRep PG,
const NodeArray< ATYPE > &  posDir,
const NodeArray< ATYPE > &  posOrthDir,
const MinimumEdgeDistances< ATYPE > &  minDist 
)

Definition at line 969 of file CompactionConstraintGraph.h.

◆ isFeasible()

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::isFeasible ( const NodeArray< ATYPE > &  pos)

Performs feasibility test for position assignment pos, i.e., checks if the segment positions given by pos fulfill the constraints in the compaction constraint graph (for debuging only)

Definition at line 1406 of file CompactionConstraintGraph.h.

◆ length()

template<class ATYPE >
ATYPE ogdf::CompactionConstraintGraph< ATYPE >::length ( edge  e) const
inline

Returns length of edge e.

Precondition
e is an edge in the constraint graph

Definition at line 143 of file CompactionConstraintGraph.h.

◆ resetGenMergerLengths()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::resetGenMergerLengths ( const PlanRep PG,
adjEntry  adjFirst 
)
private

Definition at line 345 of file CompactionConstraintGraph.h.

◆ separation()

template<class ATYPE >
ATYPE ogdf::CompactionConstraintGraph< ATYPE >::separation ( ) const
inline

Returns the separation value.

Definition at line 207 of file CompactionConstraintGraph.h.

◆ setBasicArcsZeroLength()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::setBasicArcsZeroLength ( const PlanRep PG)
private

Definition at line 573 of file CompactionConstraintGraph.h.

◆ setBoundaryCosts()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::setBoundaryCosts ( adjEntry  cornerDir,
adjEntry  cornerOppDir 
)
private

Definition at line 420 of file CompactionConstraintGraph.h.

◆ setExtra()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::setExtra ( node  v,
node  rep,
ATYPE  ofs 
)
inlineprotected

Node v has no representation in drawing, only internal representation.

Definition at line 305 of file CompactionConstraintGraph.h.

◆ setMinimumSeparation()

template<class ATYPE >
void ogdf::CompactionConstraintGraph< ATYPE >::setMinimumSeparation ( const PlanRep PG,
const NodeArray< int > &  coord,
const MinimumEdgeDistances< ATYPE > &  minDist 
)

Sets min separation for multi edge original.

Member Data Documentation

◆ c_bungeeFactor

template<class ATYPE >
const int ogdf::CompactionConstraintGraph< ATYPE >::c_bungeeFactor = 20
staticprivate

Definition at line 297 of file CompactionConstraintGraph.h.

◆ c_doubleBendFactor

template<class ATYPE >
const int ogdf::CompactionConstraintGraph< ATYPE >::c_doubleBendFactor = 20
staticprivate

double bends cost factor*vertexArcCost

Definition at line 298 of file CompactionConstraintGraph.h.

◆ c_MedianFactor

template<class ATYPE >
const int ogdf::CompactionConstraintGraph< ATYPE >::c_MedianFactor = 10*c_doubleBendFactor
staticprivate

median arcs cost factor*vertexArcCost

Definition at line 299 of file CompactionConstraintGraph.h.

◆ c_vertexArcFactor

template<class ATYPE >
const int ogdf::CompactionConstraintGraph< ATYPE >::c_vertexArcFactor = 20
staticprivate

Definition at line 296 of file CompactionConstraintGraph.h.

◆ m_bungeeCost

template<class ATYPE >
int ogdf::CompactionConstraintGraph< ATYPE >::m_bungeeCost
private

middle position distance penalty

Definition at line 287 of file CompactionConstraintGraph.h.

◆ m_centerPriority

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::m_centerPriority
private

should centering be more expensive than generalizations

Definition at line 293 of file CompactionConstraintGraph.h.

◆ m_doubleBendCost

template<class ATYPE >
int ogdf::CompactionConstraintGraph< ATYPE >::m_doubleBendCost
private

try to minimize double bends

Definition at line 289 of file CompactionConstraintGraph.h.

◆ m_extraOfs

template<class ATYPE >
NodeArray<ATYPE> ogdf::CompactionConstraintGraph< ATYPE >::m_extraOfs
private

offset of extra node to its rep, should change this

Definition at line 278 of file CompactionConstraintGraph.h.

◆ m_genToMedian

template<class ATYPE >
bool ogdf::CompactionConstraintGraph< ATYPE >::m_genToMedian
private

draw outgoing generalization from merger above ingoing gen.

Definition at line 290 of file CompactionConstraintGraph.h.

◆ m_length

template<class ATYPE >
EdgeArray<ATYPE> ogdf::CompactionConstraintGraph< ATYPE >::m_length
private

length of an edge

Definition at line 276 of file CompactionConstraintGraph.h.

◆ m_MedianArcCost

template<class ATYPE >
int ogdf::CompactionConstraintGraph< ATYPE >::m_MedianArcCost
private

draw merger gen at median of incoming generalizations

Definition at line 288 of file CompactionConstraintGraph.h.

◆ m_sep

template<class ATYPE >
ATYPE ogdf::CompactionConstraintGraph< ATYPE >::m_sep
private

Definition at line 274 of file CompactionConstraintGraph.h.

◆ m_vertexArcCost

template<class ATYPE >
int ogdf::CompactionConstraintGraph< ATYPE >::m_vertexArcCost
private

get small cages

Definition at line 286 of file CompactionConstraintGraph.h.


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