|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
55 namespace spqr_utils {
92 for (
auto ptr : skel_array) {
96 ptr->breakLinkForMasterDeconstruction();
The namespace for all OGDF objects.
Includes declaration of graph class.
The manager class for multiple OverlappingGraphCopy instances of the same graph.
Derive embedding trees from Triconnectivity information.
adjEntry getAdjInSkel(const OverlappingGraphCopy *skel, adjEntry GC_adj)
node theNode() const
Returns the node whose adjacency list contains this element.
bool isRNode(const Graph &skel)
void getIncidentRealEdgesInSubtree(adjEntry skel_adj, OverlappingGraphCopy &skel, List< edge > &out)
adjEntry getAdjInOrig(const OverlappingGraphCopy *skel, adjEntry skel_adj)
This class represents the embedding tree of a single node in a biconnected component.
EdgeArray< OverlappingGraphCopy * > twins
#define OGDF_NO_MOVE(cls)
Explicitly disables (deletes) move construction and assignment for class cls.
Wrapper class around Triconnectivity information.
Version of GraphCopySimple that may efficiently share some overlap with other instances of the same o...
const SimpleSPQRTree & spqr
Class for adjacency list elements.
OverlappingGraphCopies GC_skels
bool isSNode(const Graph &skel)
NodeSSPQRRotation(const NodeSSPQRRotation ©)=delete
bool isPNode(const Graph &skel)
edge theEdge() const
Returns the edge associated with this adjacency entry.
int numberOfEdges() const
Returns the number of edges in the graph.
Multiple GraphCopies that contain different, overlapping parts of the same original graph....
const Graph & original() const
Returns a reference to the original graph.
int numberOfNodes() const
Returns the number of nodes in the graph.
Declaration of singly linked lists and iterators.
#define OGDF_NO_COPY(cls)
Explicitly disables (deletes) copy construction and assignment for class cls.
Data type for general directed graphs (adjacency list representation).
An embedding tree representing, for a single node, all orders of incident edges in all planar embeddi...
A node in a PC-tree that is either a P-node, C-node or leaf.
node copy(node v) const
Returns the node in the graph copy corresponding to v.
Basic declarations, included by all source files.
pc_tree::PCNode * process(adjEntry skel_adj, OverlappingGraphCopy &skel, pc_tree::PCNode *parent=nullptr)
EdgeArray< SList< edge > > par_replacement
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
std::vector< OverlappingGraphCopy * > skel_array
Implementation of disjoint sets data structures (union-find functionality).
Class for the representation of edges.
Declares class Triconnectivity which realizes the Hopcroft/Tarjan algorithm for finding the triconnec...
Centralized global and local logging facility working on streams like std::cout.
EdgeArray< OverlappingGraphCopy * > skels
representation of a component
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.