 |
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
69 return *registeredAt()->graphOf();
101 return *registeredAt()->graphOf();
129 return *registeredAt()->graphOf();
133 template<OGDF_NODE_LIST NL>
142 return insert(
begin(nodeList),
end(nodeList), edgeSet, nodeMap, edgeMap);
const list_type & edges()
Returns a reference to the list of edges contained in this set.
The namespace for all OGDF objects.
const Graph & graphOf() const
Returns the associated graph.
Includes declaration of graph class.
const Graph & graphOf() const
Returns the associated graph.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
Declaration and implementation of ogdf::RegisteredSet.
Utility macros for declaring copy and move constructors and assignment operations.
HypergraphRegistry< HypernodeElement >::iterator begin(const HypergraphRegistry< HypernodeElement > &self)
internal::GraphEdgeRegistry m_regEdgeArrays
The registered edge arrays.
const list_type & nodes()
Returns a reference to the list of nodes contained in this set.
EdgeSet(const Graph &graph)
Creates a new edge set associated with graph.
GraphRegistry< EdgeElement > GraphEdgeRegistry
GraphRegistry< AdjElement, GraphAdjIterator, 2 > GraphAdjRegistry
GraphRegistry< NodeElement > GraphNodeRegistry
NodeSet(const Graph &graph)
Creates a new node set associated with graph.
Decralation of GraphElement and GraphList classes.
const Graph & graphOf() const
Returns the associated graph.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
AdjEntrySet(const Graph &graph)
Creates a new adjEntry set associated with graph.
Constant-time set operations.
std::pair< int, int > insert(const NI &nodesBegin, const NI &nodesEnd, const EI &edgesBegin, const EI &edgesEnd, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
Inserts a copy of a given subgraph into this graph.
Basic declarations, included by all source files.
const Registry * registeredAt() const
Returns the associated registry.
HypergraphRegistry< HypernodeElement >::iterator end(const HypergraphRegistry< HypernodeElement > &self)
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
RegisteredSet()
Creates an empty set associated with no registry.
internal::GraphNodeRegistry m_regNodeArrays
The registered node arrays.
#define OGDF_DEFAULT_COPY(cls)
Explicitly provides default copy construction and assignment for class cls.
internal::GraphAdjRegistry m_regAdjArrays
The registered adjEntry arrays.
const list_type & adjEntries()
Returns a reference to the list of adjEntries contained in this set.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
void reserveSpace(int new_keys)
Resizes all arrays to make space of new_keys new keys.