# OpenGraph DrawingFramework

v. 2022.02 (Dogwood)

ogdf::ExpansionGraph Class Reference

Represents expansion graph of each biconnected component of a given digraph, i.e., each vertex v with in- and outdegree greater than 1 is expanded into two vertices x and y connected by an edge x->y such that all incoming edges are moved from v to x and all outgoing edges from v to y. More...

#include <ogdf/upward/ExpansionGraph.h>

Inheritance diagram for ogdf::ExpansionGraph:

## Public Member Functions

ExpansionGraph (const Graph &G)

const SList< int > & adjacentComponents (node v) const

const SListPure< edge > & component (int i) const

int componentNumber (edge e) const

node copy (node vG) const

void init (const Graph &G)

void init (int i)

int numberOfBCs () const

edge original (edge e) const

node original (node v) const

node representative (node v) const

void setComponentNumber (edge e, int i)

void setOriginal (node vCopy, node vOriginal)

Public Member Functions inherited from ogdf::Graph
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...

Returns the largest used adjEntry index. More...

int nodeArrayTableSize () const
Returns the table size of node arrays associated with this graph. More...

int edgeArrayTableSize () const
Returns the table size of edge arrays associated with this graph. More...

Returns the table size of adjEntry arrays associated with this graph. 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 ()
Creates a new node and returns it. More...

node newNode (int index)
Creates a new node with predefined index and returns it. More...

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

edge newEdge (node v, node w, int index)
Creates a new edge (v,w) with predefined index and returns it. More...

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

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

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

virtual void delNode (node v)
Removes node v and all incident edges from the graph. More...

virtual void delEdge (edge e)
Removes edge e from the graph. More...

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

void insert (const Graph &G, NodeArray< node > &nodeMap)
Inserts Graph G as a subgraph into this Graph. More...

void insert (const Graph &G)
Inserts Graph G as a subgraph into this Graph. 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...

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...

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...

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...

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...

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

Reverses the adjacency list of v. More...

Moves adjacency entry adjMove before or after adjPos. More...

Moves adjacency entry adjMove after adjAfter. More...

Moves adjacency entry adjMove before adjBefore. More...

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...

ListIterator< NodeArrayBase * > registerArray (NodeArrayBase *pNodeArray) const
Registers a node array. More...

ListIterator< EdgeArrayBase * > registerArray (EdgeArrayBase *pEdgeArray) const
Registers an edge array. More...

ListIterator< GraphObserver * > registerStructure (GraphObserver *pStructure) const
Registers a graph observer (e.g. a ClusterGraph). More...

void unregisterArray (ListIterator< NodeArrayBase * > it) const
Unregisters a node array. More...

void unregisterArray (ListIterator< EdgeArrayBase * > it) const
Unregisters an edge array. More...

void unregisterArray (ListIterator< AdjEntryArrayBase * > it) const

void unregisterStructure (ListIterator< GraphObserver * > it) const
Unregisters a graph observer. More...

template<class ArrayBase >
void moveRegisterArray (ListIterator< ArrayBase * > it, ArrayBase *pArray) const
Move the registration it of an graph element array to pArray (used with move semantics for graph element arrays). More...

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

Graph ()
Constructs an empty graph. More...

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

virtual ~Graph ()
Destructor. More...

Graphoperator= (const Graph &G)
Assignment operator. More...

## Private Member Functions

node getCopy (node vOrig)

## Private Attributes

NodeArray< SList< int > > m_adjComponents

EdgeArray< int > m_compNum

Array< SListPure< edge > > m_component

EdgeArray< edgem_eOrig

NodeArray< nodem_vCopy

NodeArray< nodem_vOrig

NodeArray< nodem_vRep

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...

Provides a bidirectional iterator to an entry in an adjacency list. More...

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

internal::GraphObjectContainer< EdgeElementedges
The container containing all edge objects. More...

Protected Member Functions inherited from ogdf::Graph
void construct (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void assign (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void constructInitByNodes (const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
Constructs a copy of the subgraph of G induced by nodeList. More...

void constructInitByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)

void constructInitByCC (const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
Constructs a copy of connected component cc in info. More...

## Detailed Description

Represents expansion graph of each biconnected component of a given digraph, i.e., each vertex v with in- and outdegree greater than 1 is expanded into two vertices x and y connected by an edge x->y such that all incoming edges are moved from v to x and all outgoing edges from v to y.

Definition at line 50 of file ExpansionGraph.h.

## ◆ ExpansionGraph()

 ogdf::ExpansionGraph::ExpansionGraph ( const Graph & G )

## Member Function Documentation

 const SList& ogdf::ExpansionGraph::adjacentComponents ( node v ) const
inline

Definition at line 76 of file ExpansionGraph.h.

## ◆ component()

 const SListPure& ogdf::ExpansionGraph::component ( int i ) const
inline

Definition at line 71 of file ExpansionGraph.h.

## ◆ componentNumber()

 int ogdf::ExpansionGraph::componentNumber ( edge e ) const
inline

Definition at line 62 of file ExpansionGraph.h.

## ◆ copy()

 node ogdf::ExpansionGraph::copy ( node vG ) const
inline

Definition at line 92 of file ExpansionGraph.h.

## ◆ getCopy()

 node ogdf::ExpansionGraph::getCopy ( node vOrig )
inlineprivate

Definition at line 120 of file ExpansionGraph.h.

## ◆ init() [1/2]

 void ogdf::ExpansionGraph::init ( const Graph & G )

## ◆ init() [2/2]

 void ogdf::ExpansionGraph::init ( int i )

## ◆ numberOfBCs()

 int ogdf::ExpansionGraph::numberOfBCs ( ) const
inline

Definition at line 57 of file ExpansionGraph.h.

## ◆ original() [1/2]

 edge ogdf::ExpansionGraph::original ( edge e ) const
inline

Definition at line 98 of file ExpansionGraph.h.

## ◆ original() [2/2]

 node ogdf::ExpansionGraph::original ( node v ) const
inline

Definition at line 83 of file ExpansionGraph.h.

## ◆ representative()

 node ogdf::ExpansionGraph::representative ( node v ) const
inline

Definition at line 87 of file ExpansionGraph.h.

## ◆ setComponentNumber()

 void ogdf::ExpansionGraph::setComponentNumber ( edge e, int i )
inline

Definition at line 66 of file ExpansionGraph.h.

## ◆ setOriginal()

 void ogdf::ExpansionGraph::setOriginal ( node vCopy, node vOriginal )
inline

Definition at line 103 of file ExpansionGraph.h.

## Member Data Documentation

private

Definition at line 131 of file ExpansionGraph.h.

## ◆ m_compNum

 EdgeArray ogdf::ExpansionGraph::m_compNum
private

Definition at line 129 of file ExpansionGraph.h.

## ◆ m_component

 Array > ogdf::ExpansionGraph::m_component
private

Definition at line 130 of file ExpansionGraph.h.

## ◆ m_eOrig

 EdgeArray ogdf::ExpansionGraph::m_eOrig
private

Definition at line 135 of file ExpansionGraph.h.

## ◆ m_vCopy

 NodeArray ogdf::ExpansionGraph::m_vCopy
private

Definition at line 132 of file ExpansionGraph.h.

## ◆ m_vOrig

 NodeArray ogdf::ExpansionGraph::m_vOrig
private

Definition at line 133 of file ExpansionGraph.h.

## ◆ m_vRep

 NodeArray ogdf::ExpansionGraph::m_vRep
private

Definition at line 134 of file ExpansionGraph.h.

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