Home
last modified time | relevance | path

Searched refs:m_pH (Results 1 – 6 of 6) sorted by relevance

/dports/math/ogdf/OGDF/include/ogdf/cluster/
H A DClusterGraphCopyAttributes.h48 const ExtendedNestingGraph *m_pH; variable
57 m_pH(&H), m_pACG(&ACG), m_x(H,0), m_y(H,0) { } in ClusterGraphCopyAttributes()
66 node vOrig = m_pH->origNode(v); in getWidth()
72 node vOrig = m_pH->origNode(v); in getHeight()
/dports/math/ogdf/OGDF/include/ogdf/layered/
H A DOptimalHierarchyClusterLayout.h200 const ExtendedNestingGraph *m_pH; variable
H A DExtendedNestingGraph.h278 const ExtendedNestingGraph *m_pH; variable
/dports/math/ogdf/OGDF/src/ogdf/layered/
H A DSugiyamaLayout.cpp56 for(node v : m_pH->nodes) in transform()
58 node vG = m_pH->origNode(v); in transform()
65 for(edge e : m_pH->edges) in transform()
67 edge eG = m_pH->origEdge(e); in transform()
68 if(eG == nullptr || e != m_pH->chain(eG).front()) in transform()
79 ListConstIterator<edge> itE = m_pH->chain(eG).begin(); in transform()
95 if (m_pH->isReversed(eG)) in transform()
H A DExtendedNestingGraph.cpp250 m_pH = nullptr; in ClusterGraphCopy()
254 : ClusterGraph(H), m_pCG(&CG), m_pH(&H), m_copy(CG,nullptr) in ClusterGraphCopy()
268 m_pH = &H; in init()
293 reassignNode(m_pH->copy(*itV), c); in createClusterTree()
H A DOptimalHierarchyClusterLayout.cpp152 m_pH = &H; in doCall()
727 ExtendedNestingGraph::NodeType t = m_pH->type(v); in buildLayerList()