|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
45 template<
class E1,
class E2>
151 void writeGML(
const char* fileName)
const;
153 void writeGML(std::ostream& os)
const;
The namespace for all OGDF objects.
NodeArray< bool > m_extraNode
Node does not represent drawing node as we dont have positions we save a drawing representant and an ...
const OrthoRep & getOrthoRep() const
Returns underlying OrthoRep.
Includes declaration of graph class.
int cost(edge e) const
Returns cost of edge e.
Planarized representations (of a connected component) of a graph.
edge basicArc(edge e) const
Returns constraint arc representing input edge e in constraint graph.
NodeArray< node > m_extraRep
existing representant of extranodes position anchor
NodeArray< SListPure< node > > m_path
list of nodes contained in a segment
Tuples of two elements (2-tuples).
CommonCompactionConstraintGraphBase(const OrthoRep &OR, const PlanRep &PG, OrthoDir arcDir, int costAssoc)
Build constraint graph with basic arcs.
NodeArray< edge > m_originalEdge
save edge for the basic arcs
void removeRedundantVisibArcs(SListPure< Tuple2< node, node >> &visibArcs)
Removes "arcs" from visibArcs which we already have in the constraint graph (as basic arcs)
Singly linked lists (maintaining the length of the list).
bool extraNode(node v) const
Returns node status.
EdgeArray< int > m_border
only used for cage precompaction in flowcompaction computecoords
node pathNodeOf(node v) const
Returns the segment (path node in constraint graph) containing v.
void writeGML(const char *fileName) const
Writes GML output (for debugging)
EdgeArray< edge > m_edgeToBasicArc
basic arc representing an edge in PG
const Graph & getGraph() const
Returns underlying graph.
void embed()
Embeds constraint graph such that all sources and sinks lie in a common face.
Orthogonal representation of an embedded graph.
Declaration of singly linked lists and iterators.
@ MedianArc
inserted to replace some reducible in fixzerolength
node extraRep(node v) const
Returns extraNode existing anchor representant.
void computeTopologicalSegmentNum(NodeArray< int > &topNum)
Computes topological numbering on the segments of the constraint graph.
const PlanRep & getPlanRep() const
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
Base class for ogdf::CompactionConstraintGraphBase.
@ FixToZeroArc
can be compacted to zero length, can be fixed
EdgeArray< int > m_cost
cost of an edge
bool onBorder(edge e) const
Returns true if edge lies on cage border.
@ ReducibleArc
can be compacted to zero length
NodeArray< node > m_pathNode
segment containing a node in PG
Basic declarations, included by all source files.
virtual string getLengthString(edge e) const =0
ConstraintEdgeType
Types of edges in the constraint graph.
bool fixOnBorder(edge e) const
Returns true if edge is subject to length fixation if length < sep.
Class for the representation of edges.
ConstraintEdgeType typeOf(edge e) const
Returns type of edge e.
const SListPure< node > & nodesIn(node v) const
Returns list of nodes contained in segment v.
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
EdgeArray< ConstraintEdgeType > m_type
constraint type for each edge