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