Home
last modified time | relevance | path

Searched refs:numberOfCrossings (Results 1 – 20 of 20) sorted by relevance

/dports/math/ogdf/OGDF/include/ogdf/upward/
H A DUpwardPlanarizationLayout.h62 m_cr_nr = UPR.numberOfCrossings(); in call()
78 int numberOfCrossings() const { return m_cr_nr; } in numberOfCrossings() function
H A DUpwardPlanRep.h110 int numberOfCrossings() const {return crossings;} in numberOfCrossings() function
H A DLayerBasedUPRLayout.h130 int numberOfCrossings() const { return m_crossings; } in numberOfCrossings() function
/dports/math/ogdf/OGDF/src/ogdf/energybased/davidson_harel/
H A DPlanarityGrid.cpp61 m_energy = m_currentGrid->numberOfCrossings(); in computeEnergy()
76 m_candidateEnergy = m_candidateGrid->numberOfCrossings(); in compCandEnergy()
/dports/math/ogdf/OGDF/include/ogdf/planarity/embedder/
H A DCrossingStructure.h47 int numberOfCrossings() const { return m_numCrossings; } in numberOfCrossings() function
/dports/math/ogdf/OGDF/include/ogdf/planarlayout/
H A DMixedModelCrossingsBeautifierModule.h73 int numberOfCrossings() const { in numberOfCrossings() function
/dports/math/ogdf/OGDF/include/ogdf/basic/
H A DLayoutStatistics.h98 static ArrayBuffer<int> numberOfCrossings(const GraphAttributes &ga);
/dports/math/ogdf/OGDF/include/ogdf/planarity/
H A DPlanarizationGridLayout.h166 int numberOfCrossings() const { in numberOfCrossings() function
H A DPlanarizationLayout.h158 int numberOfCrossings() const { in numberOfCrossings() function
/dports/math/ogdf/OGDF/src/ogdf/upward/
H A DSubgraphUpwardPlanarizer.cpp202 if (UPR_tmp.numberOfCrossings() < bestUPR.numberOfCrossings()) { in doCall()
204 …t << std::endl << "new cr_nr:" << UPR_tmp.numberOfCrossings() << " old cr_nr : " << bestUPR.numbe… in doCall()
269 nr_cr = nr_cr + uprs[v].numberOfCrossings(); in doCall()
H A DLayerBasedUPRLayout.cpp400 OGDF_ASSERT(m_crossings <= UPR.numberOfCrossings()); in doCall()
/dports/math/ogdf/OGDF/include/ogdf/cluster/
H A DClusterPlanarizationLayout.h141 int numberOfCrossings() const {
/dports/math/ogdf/OGDF/include/ogdf/layered/
H A DSugiyamaLayout.h432 int numberOfCrossings() const { return m_nCrossings; } in numberOfCrossings() function
/dports/math/ogdf/OGDF/include/ogdf/uml/
H A DPlanarizationLayoutUML.h292 int numberOfCrossings() const { in numberOfCrossings() function
/dports/math/ogdf/OGDF/include/ogdf/energybased/davidson_harel/
H A DUniformGrid.h61 int numberOfCrossings() const {return m_crossNum;} in numberOfCrossings() function
/dports/math/ogdf/OGDF/test/src/layout/
H A Dlayout_helpers.h191 int crossingNumber = Math::sum(LayoutStatistics::numberOfCrossings(GA)) / 2; in callLayout()
/dports/math/ogdf/OGDF/src/ogdf/basic/
H A DLayoutStatistics.cpp165 ArrayBuffer<int> LayoutStatistics::numberOfCrossings(const GraphAttributes &ga) in numberOfCrossings() function in ogdf::LayoutStatistics
/dports/math/ogdf/OGDF/src/ogdf/uml/
H A DSubgraphPlanarizerUML.cpp126 int newCR = pCS->numberOfCrossings(); in postNewResult()
/dports/math/ogdf/OGDF/doc/relnotes/
H A Dcatalpa.md163 * `numberOfCrossings()` can now return statistical measures on crossings
/dports/math/ogdf/OGDF/doc/porting/
H A Dcatalpa.md370 `numberOfCrossings()` now return `ArrayBuffer`s with values for each