Home
last modified time | relevance | path

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

/dports/math/ogdf/OGDF/include/ogdf/planarity/boyer_myrvold/
H A DBoyerMyrvoldPlanar.h158 return !m_separatedDFSChildList[w].empty() && m_lowPoint[m_separatedDFSChildList[w].front()] < v; in externallyActive()
167 return m_separatedDFSChildList[w].empty() || m_lowPoint[m_separatedDFSChildList[w].front()] >= v; in inactive()
184 if (m_separatedDFSChildList[w].empty()) return 1; in infoAboutNode()
185 return m_lowPoint[m_separatedDFSChildList[w].front()] < v ? 2 : 1; in infoAboutNode()
189 if (m_separatedDFSChildList[w].empty()) return 0; in infoAboutNode()
190 return m_lowPoint[m_separatedDFSChildList[w].front()] < v ? 3 : 0; in infoAboutNode()
415 NodeArray<ListPure<node> > m_separatedDFSChildList; variable
H A DBoyerMyrvoldInit.h115 NodeArray<ListPure<node> >& m_separatedDFSChildList; variable
H A DFindKuratowskis.h274 const NodeArray<ListPure<node> >& m_separatedDFSChildList; variable
/dports/math/ogdf/OGDF/src/ogdf/planarity/boyer_myrvold/
H A DBoyerMyrvoldInit.cpp56 m_separatedDFSChildList(pBM->m_separatedDFSChildList), in BoyerMyrvoldInit()
286 … m_pNodeInParent[v] = m_separatedDFSChildList[m_realVertex[m_adjParent[v]->theNode()]].pushBack(v); in computeDFSChildLists()
H A DFindKuratowskis.cpp159 m_separatedDFSChildList(bm->m_separatedDFSChildList), in FindKuratowskis()
502 for (node temp : m_separatedDFSChildList[stop]) { in extractExternalSubgraph()
553 for (node temp : m_separatedDFSChildList[v]) { in extractExternalSubgraphBundles()
H A DBoyerMyrvoldPlanar.cpp73 m_separatedDFSChildList(g), in BoyerMyrvoldPlanar()
202 OGDF_ASSERT( !doEmbed || !m_separatedDFSChildList[x].empty() ); in mergeBiconnectedComponent()
204 m_separatedDFSChildList[x].del(m_pNodeInParent[w_child]); in mergeBiconnectedComponent()