/dports/math/ogdf/OGDF/include/ogdf/upward/ |
H A D | UpwardPlanarizationLayout.h | 62 m_cr_nr = UPR.numberOfCrossings(); in call() 78 int numberOfCrossings() const { return m_cr_nr; } in numberOfCrossings() function
|
H A D | UpwardPlanRep.h | 110 int numberOfCrossings() const {return crossings;} in numberOfCrossings() function
|
H A D | LayerBasedUPRLayout.h | 130 int numberOfCrossings() const { return m_crossings; } in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/src/ogdf/energybased/davidson_harel/ |
H A D | PlanarityGrid.cpp | 61 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 D | CrossingStructure.h | 47 int numberOfCrossings() const { return m_numCrossings; } in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/include/ogdf/planarlayout/ |
H A D | MixedModelCrossingsBeautifierModule.h | 73 int numberOfCrossings() const { in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/include/ogdf/basic/ |
H A D | LayoutStatistics.h | 98 static ArrayBuffer<int> numberOfCrossings(const GraphAttributes &ga);
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/ |
H A D | PlanarizationGridLayout.h | 166 int numberOfCrossings() const { in numberOfCrossings() function
|
H A D | PlanarizationLayout.h | 158 int numberOfCrossings() const { in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/src/ogdf/upward/ |
H A D | SubgraphUpwardPlanarizer.cpp | 202 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 D | LayerBasedUPRLayout.cpp | 400 OGDF_ASSERT(m_crossings <= UPR.numberOfCrossings()); in doCall()
|
/dports/math/ogdf/OGDF/include/ogdf/cluster/ |
H A D | ClusterPlanarizationLayout.h | 141 int numberOfCrossings() const {
|
/dports/math/ogdf/OGDF/include/ogdf/layered/ |
H A D | SugiyamaLayout.h | 432 int numberOfCrossings() const { return m_nCrossings; } in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/include/ogdf/uml/ |
H A D | PlanarizationLayoutUML.h | 292 int numberOfCrossings() const { in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/include/ogdf/energybased/davidson_harel/ |
H A D | UniformGrid.h | 61 int numberOfCrossings() const {return m_crossNum;} in numberOfCrossings() function
|
/dports/math/ogdf/OGDF/test/src/layout/ |
H A D | layout_helpers.h | 191 int crossingNumber = Math::sum(LayoutStatistics::numberOfCrossings(GA)) / 2; in callLayout()
|
/dports/math/ogdf/OGDF/src/ogdf/basic/ |
H A D | LayoutStatistics.cpp | 165 ArrayBuffer<int> LayoutStatistics::numberOfCrossings(const GraphAttributes &ga) in numberOfCrossings() function in ogdf::LayoutStatistics
|
/dports/math/ogdf/OGDF/src/ogdf/uml/ |
H A D | SubgraphPlanarizerUML.cpp | 126 int newCR = pCS->numberOfCrossings(); in postNewResult()
|
/dports/math/ogdf/OGDF/doc/relnotes/ |
H A D | catalpa.md | 163 * `numberOfCrossings()` can now return statistical measures on crossings
|
/dports/math/ogdf/OGDF/doc/porting/ |
H A D | catalpa.md | 370 `numberOfCrossings()` now return `ArrayBuffer`s with values for each
|