248 return BCTree::cutVertex(find(
uB), find(
vB));
Declaration of class BCTree.
virtual edge updateInsertedEdge(edge eG)
node find(node vB) const
The FIND function of the UNION/FIND structure.
node bcproper(node vG) const override
node cutVertex(node uB, node vB) const override
Returns the copy of a cut-vertex in the biconnected components graph which belongs to a certain B-com...
node repVertex(node uG, node vB) const override
node unite(node uB, node vB, node wB)
DynamicBCTree(Graph &G, bool callInitConnected=false)
node bComponent(node uG, node vG) const
DynamicBCTree(Graph &G, node vG, bool callInitConnected=false)
A constructor.
node condensePath(node sG, node tG)
Performs path condensation.
node insertNode(edge eG)
Inserts a new vertex into the original graph and updates the BC-tree.
NodeArray< int > m_bNode_degree
Array that contains for each proper BC-tree-vertex its degree.
virtual node updateInsertedNode(edge eG, edge fG)
Update of the dynamic BC-tree after vertex insertion into the original graph.
edge insertEdge(node sG, node tG)
Inserts a new edge into the original graph and updates the BC-tree.
NodeArray< node > m_bNode_owner
Array that contains for each BC-tree-vertex its parent in its UNION/FIND-tree structure.
node parent(node vB) const override
node bcproper(edge eG) const override
Returns the BC-tree-vertex representing the biconnected component which a given edge of the original ...
Class for the representation of edges.
Data type for general directed graphs (adjacency list representation).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
The algorithm for biconnectivity augmentation with fixed combinatorial embedding.
The algorithm for planar biconnectivity augmentation (Mutzel, Fialko).
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.