|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
24 std::cerr <<
"Could not load unix-history.gml" << std::endl;
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Declaration of class GraphAttributes which extends a Graph by additional attributes.
Includes declaration of graph class.
static bool write(const Graph &G, const string &filename, WriterFunc writer=nullptr)
Writes graph G to a file with name filename and infers the format to use from the file's extension.
static const long edgeStyle
Corresponds to edge attributes strokeColor(edge), strokeType(edge), and strokeWidth(edge).
static const long nodeStyle
Corresponds to node attributes strokeColor(node), strokeType(node), strokeWidth(node),...
The optimal ranking algorithm.
double layerDistance() const
Returns the minimal allowed y-distance between layers.
virtual void call(GraphAttributes &GA) override
Calls the layout algorithm for graph GA.
void setCrossMin(LayeredCrossMinModule *pCrossMin)
Sets the module option for the two-layer crossing minimization.
Declaration of optimal ranking algorithm for Sugiyama algorithm.
double nodeDistance() const
Returns the minimal allowed x-distance between nodes on a layer.
void setLayout(HierarchyLayoutModule *pLayout)
Sets the module option for the computation of the final layout.
static const long nodeTemplate
Corresponds to node attribute templateNode(node).
Declares class GraphIO which provides access to all graph read and write functionality.
double weightBalancing() const
Returns the weight for balancing successors below a node; 0.0 means no balancing.
Data type for general directed graphs (adjacency list representation).
static const long nodeLabel
Corresponds to node attribute label(node).
Sugiyama's layout algorithm.
static const long edgeGraphics
Corresponds to edge attribute bends(edge).
void setRanking(RankingModule *pRanking)
Sets the module option for the node ranking (layer assignment).
static bool read(Graph &G, const string &filename, ReaderFunc reader=nullptr)
Reads graph G from a file with name filename and infers the used format from the file's extension.
Declaration and implementation of the optimal third phase of the Sugiyama algorithm.
static const long nodeGraphics
Corresponds to node attributes x(node), y(node), width(node), height(node), and shape(node).
Declaration of Sugiyama algorithm.
The LP-based hierarchy layout algorithm.