50 return m_channel[v].rc[
static_cast<int>(dir)];
67 for (
node v : G.nodes) {
90 if (
si.m_adjGen ==
nullptr) {
91 int k =
si.m_nAttached[0];
92 if (k == 0 || ((k == 1 &&
siOpp.totalAttached() == 0) && !align)) {
99 int m = max(
si.m_nAttached[0],
si.m_nAttached[1]);
Declaration of orthogonal representation of planar graphs.
Data type for general directed graphs (adjacency list representation).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
Orthogonal representation of an embedded graph.
const VertexInfoUML * cageInfo(node v) const
Maintains input sizes for constructive compaction (size of routing channels, separation,...
NodeArray< vInfo > m_channel
int computeRoutingChannel(const OrthoRep::SideInfoUML &si, const OrthoRep::SideInfoUML &siOpp, bool align=false)
ATYPE & operator()(node v, OrthoDir dir)
RoutingChannel(const Graph &G, ATYPE sep, double cOver)
void computeRoutingChannels(const OrthoRep &OR, bool align=false)
const ATYPE & operator()(node v, OrthoDir dir) const
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
Information about a side of a vertex in UML diagrams.
Further information about the cages of vertices in UML diagrams.