Home
last modified time | relevance | path

Searched refs:AdjElement (Results 1 – 4 of 4) sorted by relevance

/dports/math/ogdf/OGDF/src/ogdf/basic/
H A DGraph.cpp394 AdjElement *adjSrc = new AdjElement(v); in constructInitByActiveNodes()
398 AdjElement *adjTgt = new AdjElement(w); in constructInitByActiveNodes()
529 AdjElement *adjSrc = new AdjElement(v); in newEdge()
534 AdjElement *adjTgt = new AdjElement(w); in newEdge()
575 AdjElement *adjSrc = new AdjElement(v); in newEdge()
580 AdjElement *adjTgt = new AdjElement(w); in newEdge()
603 AdjElement *adjTgt = new AdjElement(w); in newEdge()
604 AdjElement *adjSrc = new AdjElement(v); in newEdge()
634 AdjElement *adjTgt = new AdjElement(w); in newEdge()
639 AdjElement *adjSrc = new AdjElement(v); in newEdge()
[all …]
/dports/math/ogdf/OGDF/include/ogdf/basic/
H A DGraph_d.h56 class OGDF_EXPORT AdjElement; variable
71 using adjEntry = AdjElement*;
82 friend class internal::GraphList<AdjElement>;
90 explicit AdjElement(node v) : m_node(v) { } in AdjElement() function
162 static int compare(const AdjElement& x,const AdjElement& y) { return x.m_id-y.m_id; } in compare()
163 OGDF_AUGMENT_STATICCOMPARER(AdjElement)
279 inline adjEntry AdjElement::cyclicSucc() const in cyclicSucc()
284 inline adjEntry AdjElement::cyclicPred() const in cyclicPred()
310 EdgeElement(node src, node tgt, AdjElement *adjSrc, AdjElement *adjTgt, int id) : in EdgeElement()
391 inline const Graph *AdjElement::graphOf() const { in graphOf()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/decomposition/
H A DPlanarSPQRTree.cpp451 TargetComparer<AdjElement,AdjElement> comp; in embed()
534 TargetComparer<AdjElement,AdjElement> comp; in firstEmbedding()
/dports/math/ogdf/OGDF/doc/relnotes/
H A Dcatalpa.md68 * cast from `AdjElement` to corresponding `node`
237 * cast from `AdjElement` to corresponding node
238 * `AdjElement::isSource()`
239 * `AdjElement::isBetween()`