PlanarSPQRTree.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/decomposition/SPQRTree.h>
 
namespace ogdf {
class Skeleton;
template<class E>
class SListPure;
 
 
class OGDF_EXPORT PlanarSPQRTree : public virtual SPQRTree {
public:
    //
    // a) Access operations
    //
 
    double numberOfEmbeddings() const { return numberOfEmbeddings(rootNode()); }
 
 
    double numberOfEmbeddings(node v) const;
 
 
    long long numberOfNodeEmbeddings(node vT) const;
 
    //
    // b) Update operations
    //
 
 
    void reverse(node vT);
 
 
    void swap(node vT, edge e1, edge e2);
 
 
    void swap(node vT, adjEntry adj1, adjEntry adj2);
 
 
    void embed(Graph& G);
 
    void randomEmbed();
 
 
    void randomEmbed(Graph& G) {
        randomEmbed();
        embed(G);
    }
 
 
    void firstEmbedding(Graph& G);
 
 
    bool nextEmbedding(Graph& G);
 
 
    void embed(node& vT, long long x);
 
 
protected:
    void init(bool isEmbedded);
    void adoptEmbedding();
    void setPosInEmbedding(NodeArray<SListPure<adjEntry>>& adjEdges, NodeArray<node>& currentCopy,
            NodeArray<adjEntry>& lastAdj, SListPure<node>& current, const Skeleton& S, adjEntry adj);
 
    // Embeda original graph according to embeddings of skeletons.
    void expandVirtualEmbed(node vT, adjEntry adjVirt, SListPure<adjEntry>& adjEdges);
    void createInnerVerticesEmbed(Graph& G, node vT);
 
    // Enumeration of all embeddings
    void firstEmbedding(node& vT);
    void reverse(node& nP, adjEntry& first, adjEntry& last);
    bool nextEmbedding(node& vT);
    bool nextEmbedding(ListIterator<node> it);
 
    bool m_finished;
};
 
}