Version of GraphCopySimple that may efficiently share some overlap with other instances of the same original Graph via its OverlappingGraphCopies manager. More...

#include <ogdf/cluster/sync_plan/basic/OverlappingGraphCopies.h>

Inheritance diagram for ogdf::OverlappingGraphCopy:

Public Member Functions
	OverlappingGraphCopy (const OverlappingGraphCopy &copy)=delete

	OverlappingGraphCopy (OverlappingGraphCopies &mPOgc)

	OverlappingGraphCopy (OverlappingGraphCopy &&move)=delete

	~OverlappingGraphCopy () override

void	breakLinkForMasterDeconstruction ()

void	clear () override
	Removes all nodes and all edges from the graph. More...

adjEntry	copy (adjEntry adj) const
	Returns the adjacency entry in the graph copy corresponding to `adj`. More...

edge	copy (edge e) const
	Returns the edge in the graph copy corresponding to `e`. More...

node	copy (node v) const
	Returns the node in the graph copy corresponding to `v`. More...

void	delEdge (edge e) override
	Removes edge `e`. More...

void	delNode (node v) override
	Removes node `v`. More...

bool	isDummy (edge e) const
	Returns true iff `e` has no corresponding edge in the original graph. More...

bool	isDummy (node v) const
	Returns true iff `v` has no corresponding node in the original graph. More...

const OverlappingGraphCopies &	master () const
	Returns a reference to the master instance. More...

edge	newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

edge	newEdge (adjEntry adjSrc, node w, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

edge	newEdge (edge eOrig)
	Creates a new edge in the graph copy with original edge `eOrig`. More...

edge	newEdge (node v, adjEntry adjTgt, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

edge	newEdge (node v, node w, int index=-1)
	Creates a new edge (`v`,`w`) and returns it. More...

template<typename S , typename T >
edge	newEdge (S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

node	newNode (int index=-1)
	Creates a new node and returns it. More...

node	newNode (node vOrig)
	Creates a new node in the graph copy with original node `vOrig`. More...

OverlappingGraphCopy &	operator= (const OverlappingGraphCopy &copy)=delete

OverlappingGraphCopy &	operator= (OverlappingGraphCopy &&move)=delete

const Graph &	original () const
	Returns a reference to the original graph. More...

adjEntry	original (adjEntry adj) const
	Returns the adjacency entry in the original graph corresponding to `adj`. More...

edge	original (edge e) const
	Returns the edge in the original graph corresponding to `e`. More...

node	original (node v) const
	Returns the node in the original graph corresponding to `v`. More...

Public Member Functions inherited from ogdf::Graph
	Graph ()
	Constructs an empty graph. More...

	Graph (const Graph &copy)
	Constructs a graph that is a copy of `G`. More...

	Graph (Graph &&move)=delete

virtual	~Graph ()
	Destructor. More...

Graph &	operator= (const Graph &copy)
	Overwrites this graph to be a copy of `G`. More...

Graph &	operator= (Graph &&move)=delete

bool	empty () const
	Returns true iff the graph is empty, i.e., contains no nodes. More...

int	numberOfNodes () const
	Returns the number of nodes in the graph. More...

int	numberOfEdges () const
	Returns the number of edges in the graph. More...

int	maxNodeIndex () const
	Returns the largest used node index. More...

int	maxEdgeIndex () const
	Returns the largest used edge index. More...

int	maxAdjEntryIndex () const
	Returns the largest used adjEntry index. More...

node	firstNode () const
	Returns the first node in the list of all nodes. More...

node	lastNode () const
	Returns the last node in the list of all nodes. More...

edge	firstEdge () const
	Returns the first edge in the list of all edges. More...

edge	lastEdge () const
	Returns the last edge in the list of all edges. More...

node	chooseNode (std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const
	Returns a random node. More...

edge	chooseEdge (std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const
	Returns a random edge. More...

template<class CONTAINER >
void	allNodes (CONTAINER &nodeContainer) const
	Returns a container with all nodes of the graph. More...

template<class CONTAINER >
void	allEdges (CONTAINER &edgeContainer) const
	Returns a container with all edges of the graph. More...

node	newNode (int index=-1)
	Creates a new node and returns it. More...

edge	newEdge (node v, node w, int index=-1)
	Creates a new edge (`v`,`w`) and returns it. More...

edge	newEdge (node v, adjEntry adjTgt, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

edge	newEdge (adjEntry adjSrc, node w, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

edge	newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

template<typename S , typename T >
edge	newEdge (S src, Direction dirSrc, T tgt, Direction dirTgt, int index=-1)
	Creates a new edge at predefined positions in the adjacency lists. More...

void	restoreAllEdges ()
	Restore all hidden edges and invalidate all HiddenEdgeSets. More...

virtual edge	split (edge e)
	Splits edge `e` into two edges introducing a new node. More...

void	unsplit (node u)
	Undoes a split operation. More...

virtual void	unsplit (edge eIn, edge eOut)
	Undoes a split operation. More...

node	splitNode (adjEntry adjStartLeft, adjEntry adjStartRight)
	Splits a node while preserving the order of adjacency entries. More...

node	contract (edge e, bool keepSelfLoops=false)
	Contracts edge `e` while preserving the order of adjacency entries. More...

void	move (edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)
	Moves edge `e` to a different adjacency list. More...

void	moveTarget (edge e, node w)
	Moves the target node of edge `e` to node `w`. More...

void	moveTarget (edge e, adjEntry adjTgt, Direction dir)
	Moves the target node of edge `e` to a specific position in an adjacency list. More...

void	moveSource (edge e, node w)
	Moves the source node of edge `e` to node `w`. More...

void	moveSource (edge e, adjEntry adjSrc, Direction dir)
	Moves the source node of edge `e` to a specific position in an adjacency list. More...

edge	searchEdge (node v, node w, bool directed=false) const
	Searches and returns an edge connecting nodes `v` and `w` in time O( min(deg(`v` ), deg(`w` ))). More...

void	reverseEdge (edge e)
	Reverses the edge `e`, i.e., exchanges source and target node. More...

void	reverseAllEdges ()
	Reverses all edges in the graph. More...

template<class NODELIST >
void	collapse (NODELIST &nodesToCollapse)
	Collapses all nodes in the list `nodesToCollapse` to the first node in the list. More...

template<class ADJ_ENTRY_LIST >
void	sort (node v, const ADJ_ENTRY_LIST &newOrder)
	Sorts the adjacency list of node `v` according to `newOrder`. More...

template<class IT >
void	sort (node v, IT begin, IT end)
	Sorts the adjacency list of node `v` according to the range denoted by two iterators. More...

void	reverseAdjEdges (node v)
	Reverses the adjacency list of `v`. More...

void	moveAdj (adjEntry adjMove, Direction dir, adjEntry adjPos)
	Moves adjacency entry `adjMove` before or after `adjPos`. More...

void	moveAdjAfter (adjEntry adjMove, adjEntry adjAfter)
	Moves adjacency entry `adjMove` after `adjAfter`. More...

void	moveAdjBefore (adjEntry adjMove, adjEntry adjBefore)
	Moves adjacency entry `adjMove` before `adjBefore`. More...

void	reverseAdjEdges ()
	Reverses all adjacency lists. More...

void	swapAdjEdges (adjEntry adj1, adjEntry adj2)
	Exchanges two entries in an adjacency list. More...

int	genus () const
	Returns the genus of the graph's embedding. More...

bool	representsCombEmbedding () const
	Returns true iff the graph represents a combinatorial embedding. More...

void	consistencyCheck () const
	Asserts that this graph is consistent. More...

internal::GraphNodeRegistry &	nodeRegistry ()
	Returns a reference to the registry of node arrays associated with this graph. More...

const internal::GraphNodeRegistry &	nodeRegistry () const
	Returns a const reference to the registry of node arrays associated with this graph. More...

	operator const internal::GraphNodeRegistry & () const

internal::GraphEdgeRegistry &	edgeRegistry ()
	Returns a reference to the registry of edge arrays associated with this graph. More...

const internal::GraphEdgeRegistry &	edgeRegistry () const
	Returns a const reference to the registry of edge arrays associated with this graph. More...

	operator const internal::GraphEdgeRegistry & () const

internal::GraphAdjRegistry &	adjEntryRegistry ()
	Returns a reference to the registry of adjEntry arrays associated with this graph. More...

const internal::GraphAdjRegistry &	adjEntryRegistry () const
	Returns a const reference to the registry of adjEntry arrays associated with this graph. More...

	operator const internal::GraphAdjRegistry & () const

void	resetEdgeIdCount (int maxId)
	Resets the edge id count to `maxId`. More...

void	resetNodeIdCount (int maxId)

template<OGDF_NODE_ITER NI, OGDF_EDGE_ITER EI, bool copyEmbedding = true, bool copyIDs = false, bool notifyObservers = true>
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. More...

template<OGDF_NODE_ITER NI, OGDF_EDGE_FILTER EF, bool copyIDs = false, bool notifyObservers = true>
std::pair< int, int >	insert (const NI &nodesBegin, const NI &nodesEnd, const EF &edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given subgraph into this graph. More...

template<OGDF_NODE_LIST NL>
std::pair< int, int >	insert (const NL &nodeList, const EdgeSet< true > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given subgraph into this graph. More...

template<OGDF_NODE_LIST NL>
std::pair< int, int >	insert (const NL &nodeList, const EdgeSet< false > &edgeSet, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given subgraph into this graph. More...

template<OGDF_NODE_LIST NL, OGDF_EDGE_LIST EL>
std::pair< int, int >	insert (const NL &nodeList, const EL &edgeList, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given subgraph into this graph. More...

std::pair< int, int >	insert (const CCsInfo &info, int cc, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given connected component `cc` into this graph. More...

std::pair< int, int >	insert (const Graph &G, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap)
	Inserts a copy of a given Graph `G` into this graph. More...

std::pair< int, int >	insert (const Graph &G)
	Inserts a copy of a given Graph `G` into this graph. More...

Public Member Functions inherited from ogdf::Observable< GraphObserver, Graph >
	Observable ()=default

	Observable (const Observable &copy)=delete
	If you want to copy a subclass of Observable, call the default Observable() constructor. More...

	Observable (Observable &&move)=delete
	If you want to move a subclass of Observable, call the default Observable() constructor. More...

virtual	~Observable ()

Observable &	operator= (const Observable &copy)=delete

Observable &	operator= (Observable &&move)=delete

Private Member Functions
void	unmap ()

Private Attributes
EdgeArray< edge >	m_eOrig
	The corresponding edge in the original graph. More...

OverlappingGraphCopies *	m_pOGC
	The master instance. More...

NodeArray< node >	m_vOrig
	The corresponding node in the original graph. More...

Friends
class	OverlappingGraphCopies

Additional Inherited Members
Public Types inherited from ogdf::Graph
enum	EdgeType { EdgeType::association = 0, EdgeType::generalization = 1, EdgeType::dependency = 2 }
	The type of edges (only used in derived classes). More...

enum	NodeType { NodeType::vertex = 0, NodeType::dummy = 1, NodeType::generalizationMerger = 2, NodeType::generalizationExpander = 3, NodeType::highDegreeExpander = 4, NodeType::lowDegreeExpander = 5, NodeType::associationClass = 6 }
	The type of nodes. More...

using	node_iterator = internal::GraphIterator< node >
	Provides a bidirectional iterator to a node in a graph. More...

using	edge_iterator = internal::GraphIterator< edge >
	Provides a bidirectional iterator to an edge in a graph. More...

using	adjEntry_iterator = internal::GraphIterator< adjEntry >
	Provides a bidirectional iterator to an entry in an adjacency list. More...

Public Attributes inherited from ogdf::Graph
internal::GraphObjectContainer< NodeElement >	nodes
	The container containing all node objects. More...

internal::GraphObjectContainer< EdgeElement >	edges
	The container containing all edge objects. More...

Protected Member Functions inherited from ogdf::Graph
virtual void *	preInsert (bool copyEmbedding, bool copyIDs, bool notifyObservers, bool edgeFilter, NodeArray< node > &nodeMap, EdgeArray< edge > &edgeMap, int newNodes, int newEdges)
	Callback notifying subclasses that some graph is about to be insert() -ed. More...

virtual void	nodeInserted (void *userData, node original, node copy)
	Callback notifying subclasses that insert() copied a node. More...

virtual void	edgeInserted (void *userData, edge original, edge copy)
	Callback notifying subclasses that insert() copied an edge. More...

virtual void	postInsert (void *userData, int newNodes, int newEdges)
	Callback notifying subclasses that an insert() call has finished. More...

Protected Member Functions inherited from ogdf::Observable< GraphObserver, Graph >
void	clearObservers ()

const ListPure< GraphObserver * > &	getObservers () const

Detailed Description

Version of GraphCopySimple that may efficiently share some overlap with other instances of the same original Graph via its OverlappingGraphCopies manager.

Definition at line 44 of file OverlappingGraphCopies.h.

Constructor & Destructor Documentation

◆ OverlappingGraphCopy() [1/3]

ogdf::OverlappingGraphCopy::OverlappingGraphCopy ( OverlappingGraphCopies & mPOgc )

inlineexplicit

Definition at line 54 of file OverlappingGraphCopies.h.

◆ ~OverlappingGraphCopy()

ogdf::OverlappingGraphCopy::~OverlappingGraphCopy ( )

inlineoverride

Definition at line 57 of file OverlappingGraphCopies.h.

◆ OverlappingGraphCopy() [2/3]

ogdf::OverlappingGraphCopy::OverlappingGraphCopy ( OverlappingGraphCopy && move )

delete

◆ OverlappingGraphCopy() [3/3]

ogdf::OverlappingGraphCopy::OverlappingGraphCopy ( const OverlappingGraphCopy & copy )

delete

Member Function Documentation

◆ breakLinkForMasterDeconstruction()

void ogdf::OverlappingGraphCopy::breakLinkForMasterDeconstruction ( )

inline

Definition at line 192 of file OverlappingGraphCopies.h.

◆ clear()

void ogdf::OverlappingGraphCopy::clear ( )

inlineoverridevirtual

Removes all nodes and all edges from the graph.

Reimplemented from ogdf::Graph.

Definition at line 187 of file OverlappingGraphCopies.h.

◆ copy() [1/3]

adjEntry ogdf::OverlappingGraphCopy::copy ( adjEntry adj ) const

inline

Returns the adjacency entry in the graph copy corresponding to adj.

Note that this method does not pay attention to reversed edges. Given a source (target) adjacency entry, the source (target) adjacency entry of the copy edge is returned.

Parameters

adj	is an adjacency entry in the original graph.

Returns: the corresponding adjacency entry in the graph copy, or nullptr if it doesn't exists.

Definition at line 135 of file OverlappingGraphCopies.h.

◆ copy() [2/3]

edge ogdf::OverlappingGraphCopy::copy ( edge e ) const

Returns the edge in the graph copy corresponding to e.

Parameters

e	is an edge in the original graph.

Returns: the corresponding edge in the graph copy, or nullptr if it doesn't exists.

◆ copy() [3/3]

node ogdf::OverlappingGraphCopy::copy ( node v ) const

Returns the node in the graph copy corresponding to v.

Parameters

v	is a node in the original graph.

Returns: the corresponding node in the graph copy, or nullptr if it doesn't exists.

◆ delEdge()

void ogdf::OverlappingGraphCopy::delEdge ( edge e )

overridevirtual

Removes edge e.

Parameters

e	is an edge in the graph copy.

Reimplemented from ogdf::Graph.

◆ delNode()

void ogdf::OverlappingGraphCopy::delNode ( node v )

overridevirtual

Removes node v.

Parameters

v	is a node in the graph copy.

Reimplemented from ogdf::Graph.

◆ isDummy() [1/2]

bool ogdf::OverlappingGraphCopy::isDummy ( edge e ) const

inline

Returns true iff e has no corresponding edge in the original graph.

Parameters

e	is an edge in the graph copy.

Definition at line 153 of file OverlappingGraphCopies.h.

◆ isDummy() [2/2]

bool ogdf::OverlappingGraphCopy::isDummy ( node v ) const

inline

Returns true iff v has no corresponding node in the original graph.

Parameters

v	is a node in the graph copy.

Definition at line 147 of file OverlappingGraphCopies.h.

◆ master()

const OverlappingGraphCopies& ogdf::OverlappingGraphCopy::master ( ) const

inline

Returns a reference to the master instance.

Definition at line 64 of file OverlappingGraphCopies.h.

◆ newEdge() [1/6]

edge ogdf::Graph::newEdge

inline

Creates a new edge at predefined positions in the adjacency lists.

Let v be the node whose adjacency list contains adjSrc, and w the node whose adjacency list contains adjTgt. Then, the created edge is (v,w).

Parameters

adjSrc	is the adjacency entry before / after which the new edge is inserted in the adjacency list of v.
adjTgt	is the adjacency entry before / after which the new edge is inserted in the adjacency list of w.
dir	specifies if the edge is inserted before or after the given adjacency entries.
index	is the index that will be assigned to the newly created edge. If negative or not given will use the next free index `maxEdgeIndex()`. Passing an edge index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created edge.

Definition at line 1135 of file Graph_d.h.

◆ newEdge() [2/6]

edge ogdf::Graph::newEdge

inline

Creates a new edge at predefined positions in the adjacency lists.

Let v be the node whose adjacency list contains adjSrc. Then, the created edge is (v,w).

Parameters

adjSrc	is the adjacency entry after which the new edge is inserted in the adjacency list of v.
w	is the target node of the new edge; the edge is added at the end of the adjacency list of `w`.
index	is the index that will be assigned to the newly created edge. If negative or not given will use the next free index `maxEdgeIndex()`. Passing an edge index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created edge.

Definition at line 1113 of file Graph_d.h.

◆ newEdge() [3/6]

edge ogdf::OverlappingGraphCopy::newEdge ( edge eOrig )

Creates a new edge in the graph copy with original edge eOrig.

Warning: You have to make sure that the original edge makes sense, in particular that eOrig is not the original edge of another edge in the copy.

◆ newEdge() [4/6]

edge ogdf::Graph::newEdge

inline

Creates a new edge at predefined positions in the adjacency lists.

Let w be the node whose adjacency list contains adjTgt. Then, the created edge is (v,w).

Parameters

v	is the source node of the new edge; the edge is added at the end of the adjacency list of `v`.
adjTgt	is the adjacency entry after which the new edge is inserted in the adjacency list of w.
index	is the index that will be assigned to the newly created edge. If negative or not given will use the next free index `maxEdgeIndex()`. Passing an edge index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created edge.

Definition at line 1094 of file Graph_d.h.

◆ newEdge() [5/6]

edge ogdf::Graph::newEdge

inline

Creates a new edge (v,w) and returns it.

Parameters

v	is the source node of the newly created edge.
w	is the target node of the newly created edge.
index	is the index that will be assigned to the newly created edge. If negative or not given will use the next free index `maxEdgeIndex()`. Passing an edge index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created edge.

Definition at line 1075 of file Graph_d.h.

◆ newEdge() [6/6]

template<typename S , typename T >

edge ogdf::Graph::newEdge	(	typename S	,
		typename T
	)

inline

Creates a new edge at predefined positions in the adjacency lists.

Let v either be the node src or the node whose adjacency list contains the adjEntry src, and w either the node tgt or the node whose adjacency list contains the adjEntry tgt. Then, the created edge is (v,w).

Parameters

src	is v or the adjacency entry before / after which the new edge is inserted in the adjacency list of v.
dirSrc	specifies if the edge is inserted before or after `adjSrc`.
tgt	is w or the adjacency entry before / after which the new edge is inserted in the adjacency list of w.
dirTgt	specifies if the edge is inserted before or after `adjTgt`.
index	is the index that will be assigned to the newly created edge. If negative or not given will use the next free index `maxEdgeIndex()`. Passing an edge index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created edge.

Definition at line 1160 of file Graph_d.h.

◆ newNode() [1/2]

node ogdf::Graph::newNode

inline

Creates a new node and returns it.

Parameters

index is the index that will be assigned to the newly created node. If negative or not given will use the next free index maxNodeIndex(). Passing a node index that is already in use results in an inconsistent data structure. Only specify this parameter if you know what you're doing!

Returns: the newly created node.

Definition at line 1056 of file Graph_d.h.

◆ newNode() [2/2]

node ogdf::OverlappingGraphCopy::newNode ( node vOrig )

Creates a new node in the graph copy with original node vOrig.

Warning: You have to make sure that the original node makes sense, in particular that vOrig is not the original node of another node in the copy.

◆ operator=() [1/2]

OverlappingGraphCopy& ogdf::OverlappingGraphCopy::operator= ( const OverlappingGraphCopy & copy )

delete

◆ operator=() [2/2]

OverlappingGraphCopy& ogdf::OverlappingGraphCopy::operator= ( OverlappingGraphCopy && move )

delete

◆ original() [1/4]

const Graph& ogdf::OverlappingGraphCopy::original ( ) const

Returns a reference to the original graph.

◆ original() [2/4]

adjEntry ogdf::OverlappingGraphCopy::original ( adjEntry adj ) const

inline

Returns the adjacency entry in the original graph corresponding to adj.

Note that this method does not pay attention to reversed edges. Given a source (target) adjacency entry, the source (target) adjacency entry of the original edge is returned.

Parameters

adj	is an adjacency entry in the copy graph.

Returns: the corresponding adjacency entry in the original graph.

Definition at line 103 of file OverlappingGraphCopies.h.

◆ original() [3/4]

edge ogdf::OverlappingGraphCopy::original ( edge e ) const

inline

Returns the edge in the original graph corresponding to e.

Parameters

e	is an edge in the graph copy.

Returns: the corresponding edge in the original graph, or 0 if no such edge exists.

Definition at line 87 of file OverlappingGraphCopies.h.

◆ original() [4/4]

node ogdf::OverlappingGraphCopy::original ( node v ) const

inline

Returns the node in the original graph corresponding to v.

Parameters

v	is a node in the graph copy.

Returns: the corresponding node in the original graph, or 0 if no such node exists.

Definition at line 75 of file OverlappingGraphCopies.h.

◆ unmap()

void ogdf::OverlappingGraphCopy::unmap ( )

private

Friends And Related Function Documentation

◆ OverlappingGraphCopies

friend class OverlappingGraphCopies

friend

Definition at line 45 of file OverlappingGraphCopies.h.

Member Data Documentation

◆ m_eOrig

EdgeArray<edge> ogdf::OverlappingGraphCopy::m_eOrig

private

The corresponding edge in the original graph.

Definition at line 49 of file OverlappingGraphCopies.h.

◆ m_pOGC

OverlappingGraphCopies* ogdf::OverlappingGraphCopy::m_pOGC

private

The master instance.

Definition at line 47 of file OverlappingGraphCopies.h.

◆ m_vOrig

NodeArray<node> ogdf::OverlappingGraphCopy::m_vOrig

private

The corresponding node in the original graph.

Definition at line 48 of file OverlappingGraphCopies.h.

The documentation for this class was generated from the following file:

include/ogdf/cluster/sync_plan/basic/OverlappingGraphCopies.h

OpenGraph DrawingFramework

Public Member Functions

Private Member Functions

Private Attributes

Friends

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ OverlappingGraphCopy() [1/3]

◆ ~OverlappingGraphCopy()

◆ OverlappingGraphCopy() [2/3]

◆ OverlappingGraphCopy() [3/3]

Member Function Documentation

◆ breakLinkForMasterDeconstruction()

◆ clear()

◆ copy() [1/3]

◆ copy() [2/3]

◆ copy() [3/3]

◆ delEdge()

◆ delNode()

◆ isDummy() [1/2]

◆ isDummy() [2/2]

◆ master()

◆ newEdge() [1/6]

◆ newEdge() [2/6]

◆ newEdge() [3/6]

◆ newEdge() [4/6]

◆ newEdge() [5/6]

◆ newEdge() [6/6]

◆ newNode() [1/2]

◆ newNode() [2/2]

◆ operator=() [1/2]

◆ operator=() [2/2]

◆ original() [1/4]

◆ original() [2/4]

◆ original() [3/4]

◆ original() [4/4]

◆ unmap()

Friends And Related Function Documentation

◆ OverlappingGraphCopies

Member Data Documentation

◆ m_eOrig

◆ m_pOGC

◆ m_vOrig

Open
Graph Drawing
Framework