Graph Drawing

 v. 2023.09 (Elderberry)

No Matches
Go to the documentation of this file.
7using namespace ogdf;
9int main()
11 Graph G;
12 GraphAttributes GA(G,
19 if (!GraphIO::read(GA, G, "unix-history.gml", GraphIO::readGML)) {
20 std::cerr << "Could not load unix-history.gml" << std::endl;
21 return 1;
22 }
29 ohl->layerDistance(30.0);
30 ohl->nodeDistance(25.0);
31 ohl->weightBalancing(0.8);
32 SL.setLayout(ohl);
35 GraphIO::write(GA, "output-unix-history-hierarchical.gml", GraphIO::writeGML);
36 GraphIO::write(GA, "output-unix-history-hierarchical.svg", GraphIO::drawSVG);
38 return 0;
Declares class GraphIO which provides access to all graph read and write functionality.
Declaration of class MedianHeuristic.
Declaration and implementation of the optimal third phase of the Sugiyama algorithm.
Declaration of optimal ranking algorithm for Sugiyama algorithm.
Declaration of Sugiyama algorithm.
Stores additional attributes of a graph (like layout information).
static const long edgeStyle
Corresponds to edge attributes strokeColor(edge), strokeType(edge), and strokeWidth(edge).
static const long nodeLabel
Corresponds to node attribute label(node).
static const long nodeTemplate
Corresponds to node attribute templateNode(node).
static const long nodeStyle
Corresponds to node attributes strokeColor(node), strokeType(node), strokeWidth(node),...
static const long edgeGraphics
Corresponds to edge attribute bends(edge).
static const long nodeGraphics
Corresponds to node attributes x(node), y(node), width(node), height(node), and shape(node).
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:521
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 bool writeGML(const Graph &G, std::ostream &os)
Writes graph G in GML format to output stream os.
static bool drawSVG(const GraphAttributes &A, std::ostream &os, const SVGSettings &settings)
static bool readGML(Graph &G, std::istream &is)
Reads graph G in GML format from input stream is.
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.
The median heuristic for 2-layer crossing minimization.
The LP-based hierarchy layout algorithm.
double layerDistance() const
Returns the minimal allowed y-distance between layers.
double weightBalancing() const
Returns the weight for balancing successors below a node; 0.0 means no balancing.
double nodeDistance() const
Returns the minimal allowed x-distance between nodes on a layer.
The optimal ranking algorithm.
Sugiyama's layout algorithm.
void setLayout(HierarchyLayoutModule *pLayout)
Sets the module option for the computation of the final layout.
void setCrossMin(LayeredCrossMinModule *pCrossMin)
Sets the module option for the two-layer crossing minimization.
virtual void call(GraphAttributes &GA) override
Calls the layout algorithm for graph GA.
void setRanking(RankingModule *pRanking)
Sets the module option for the node ranking (layer assignment).
int main()
The namespace for all OGDF objects.