|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
133 virtual void hypernodeDeleted(
hypernode v)
override;
136 virtual void hypernodeAdded(
hypernode v)
override;
139 virtual void hyperedgeDeleted(
hyperedge e)
override;
142 virtual void hyperedgeAdded(
hyperedge e)
override;
145 virtual void cleared()
override;
148 void constructCliqueRep();
150 void constructStarRep();
152 void constructTreeRep();
154 void hyperedgeToTree(
hyperedge e,
int degree);
158 void cloneHypernodes();
List< node > m_dummyNodes
The list of all newly created nodes.
The namespace for all OGDF objects.
Includes declaration of graph class.
const List< node > & dummyNodes() const
Returns the list of dummy nodes.
const Graph & constGraph() const
Returns a reference to the representation graph.
NodeArray< hypernode > m_hypernodeMap
The map from representation nodes to hypernodes.
HypernodeArray< node > m_nodeMap
The map from representation hypernodes to nodes.
RegisteredArray for nodes and edges of a hypergraph.
HyperedgeArray< List< edge > > m_edgeMap
The map from representation hyperedge to edges.
hyperedge hyperedgeMap(edge e)
Returns the hyperedge associated with the edge.
hypernode hypernodeMap(node v)
Returns the hypernode associated with the node (if any).
EdgeStandardType
Enumeration class of possible edge standard representations.
Class for the representation of hyperedges.
Graph m_graphRep
Edge standard representation of the hypergraph.
Declaration and a partial implementation of a Hypergraph class partly based on the original classes f...
const Hypergraph & hypergraph() const
Conversion to original hypergraph reference.
EdgeArray< hyperedge > m_hyperedgeMap
The map from representation edge to hyperedges.
Abstract base class for observers on hypergraphs, that need to be informed about hypergraph changes (...
Edge standard representation of hypergraphs.
@ star
for every hyperedge e = {v_1, ..., v_l} a single new dummy node v_e is introduced,...
node nodeMap(hypernode v)
Returns the node associated with the hypernode.
Doubly linked lists (maintaining the length of the list).
RegisteredArray for nodes, edges and adjEntries of a graph.
EdgeStandardType type() const
Returns the type of edge standard representation.
@ clique
no new dummy nodes are introduced, for every hyperedge e = (v_1, ..., v_l), we add a cliqie K_l conne...
Data type for general directed graphs (adjacency list representation).
@ tree
for every hyperedge e a minimal subcubic tree connecting all hypernodes incident with e together is a...
const List< edge > & edgeMap(hyperedge e)
Returns the list of edges associated with the hyperedge.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Class for the representation of edges.
Declaration of doubly linked lists and iterators.
const Hypergraph * m_hypergraph
The reference to the original hypergraph.
EdgeStandardType m_type
The type of edge standard representation.
Class for the representation of nodes.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
Class for the representation of hypernodes.