69 std::vector<std::vector<int>>
tau;
70 std::vector<std::vector<int>>
sigma;
71 std::vector<std::vector<int>>
mu;
Includes declaration of graph class.
Declaration of class Minisat.
Represents a simple class for model storage.
Class for adjacency list elements.
Copies of graphs supporting edge splitting.
Data type for general directed graphs (adjacency list representation).
Doubly linked lists (maintaining the length of the list).
int getNumberOfVariables()
void computeMuVariables()
void embedFromModel(const Minisat::Model &model, adjEntry &externalToItsRight)
void sortBySigma(List< adjEntry > &adjList, const Minisat::Model &model)
UpSAT(GraphCopy &G, bool feasibleOriginalEdges)
long long numberOfClauses
void computeTauVariables()
std::vector< std::vector< int > > mu
void computeSigmaVariables()
EdgeArray< List< edge > > D
bool FPSS(NodeArray< int > *nodeOrder)
bool HL(bool embed, adjEntry &externalToItsRight, NodeArray< int > *nodeOrder)
void writeNodeOrder(const Minisat::Model &model, NodeArray< int > *nodeOrder)
void ruleFixed(const Minisat::Model &model)
void computeDominatingEdges()
bool OE(bool embed, adjEntry &externalToItsRight, NodeArray< int > *nodeOrder)
bool testUpwardPlanarity(NodeArray< int > *nodeOrder=nullptr)
long long getNumberOfClauses()
bool embedUpwardPlanar(adjEntry &externalToItsRight, NodeArray< int > *nodeOrder=nullptr)
std::vector< std::vector< int > > sigma
void ruleSigmaTransitive()
std::vector< std::vector< int > > tau
bool feasibleOriginalEdges
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
The namespace for all OGDF objects.