void ConstCombinatorialEmbedding::computeFaces() { m_externalFace = nullptr; // no longer valid! m_faceIdCount = 0; faces.clear(); m_rightFace.fill(nullptr); for(node v : m_cpGraph->nodes) { for(adjEntry adj : v->adjEdges) { if (m_rightFace[adj]) continue; #ifdef OGDF_DEBUG face f = OGDF_NEW FaceElement(this,adj,m_faceIdCount++); #else face f = OGDF_NEW FaceElement(adj,m_faceIdCount++); #endif faces.pushBack(f); adjEntry adj2 = adj; do { m_rightFace[adj2] = f; f->m_size++; adj2 = adj2->faceCycleSucc(); } while (adj2 != adj); } } m_faceArrayTableSize = Graph::nextPower2(MIN_FACE_TABLE_SIZE,m_faceIdCount); reinitArrays(); OGDF_ASSERT_IF(dlConsistencyChecks, consistencyCheck()); }
ClusterGraph &ClusterGraph::operator=(const ClusterGraph &C) { clear(); shallowCopy(C); m_clusterArrayTableSize = C.m_clusterArrayTableSize; reinitArrays(); OGDF_ASSERT_IF(dlConsistencyChecks, consistencyCheck()); return *this; }
void Graph::assign(const Graph &G, NodeArray<node> &mapNode, EdgeArray<edge> &mapEdge) { clear(); copy(G,mapNode,mapEdge); m_nodeArrayTableSize = nextPower2(MIN_NODE_TABLE_SIZE,m_nodeIdCount); m_edgeArrayTableSize = nextPower2(MIN_EDGE_TABLE_SIZE,m_edgeIdCount); reinitArrays(); }
Graph &Graph::operator=(const Graph &G) { clear(); copy(G); m_nodeArrayTableSize = nextPower2(MIN_NODE_TABLE_SIZE,m_nodeIdCount); m_edgeArrayTableSize = nextPower2(MIN_EDGE_TABLE_SIZE,m_edgeIdCount); reinitArrays(); OGDF_ASSERT_IF(dlConsistencyChecks, consistencyCheck()); return *this; }
void ConstCombinatorialEmbedding::init() { m_cpGraph = nullptr; m_externalFace = nullptr; m_faceIdCount = 0; m_faceArrayTableSize = MIN_FACE_TABLE_SIZE; m_rightFace.init(); faces.clear(); reinitArrays(); }
void CombinatorialEmbedding::clear() { m_pGraph->clear(); faces.clear(); m_faceIdCount = 0; m_faceArrayTableSize = MIN_FACE_TABLE_SIZE; m_externalFace = nullptr; reinitArrays(); OGDF_ASSERT_IF(dlConsistencyChecks, consistencyCheck()); }