|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
55 return m_channel[v].rc[
static_cast<int>(dir)];
72 for (
node v : G.nodes) {
97 if (k == 0 || ((k == 1 && siOpp.
totalAttached() == 0) && !align)) {
The namespace for all OGDF objects.
Includes declaration of graph class.
Further information about the cages of vertices in UML diagrams.
Information about a side of a vertex in UML diagrams.
Declaration of orthogonal representation of planar graphs.
Orthogonal representation of an embedded graph.
const ATYPE & operator()(node v, OrthoDir dir) const
Decralation of GraphElement and GraphList classes.
NodeArray< vInfo > m_channel
RoutingChannel(const Graph &G, ATYPE sep, double cOver)
void computeRoutingChannels(const OrthoRep &OR, bool align=false)
const VertexInfoUML * cageInfo(node v) const
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
int totalAttached() const
Basic declarations, included by all source files.
ATYPE & operator()(node v, OrthoDir dir)
int computeRoutingChannel(const OrthoRep::SideInfoUML &si, const OrthoRep::SideInfoUML &siOpp, bool align=false)
Class for the representation of nodes.
Maintains input sizes for constructive compaction (size of routing channels, separation,...