|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
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.
Declaration of basic types for graphics.
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.
const Color & fillColor(node v) const
Returns the fill color of node v.
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),...
static bool drawSVG(const GraphAttributes &A, std::ostream &os, const SVGSettings &settings)
int index() const
Returns the (unique) node index.
Declaration of class PlanarStraightLayout which represents a planar straight-line drawing algorithm.
bool directed() const
Returns if the graph is directed.
std::unique_ptr< Graph > g
The 4-connected component.
void callFixEmbed(GraphAttributes &AG, adjEntry adjExternal=nullptr)
Calls the grid layout algorithm with a fixed planar embedding (general call).
Class for adjacency list elements.
Declaration of randomized graph generators.
internal::GraphObjectContainer< NodeElement > nodes
The container containing all node objects.
static std::unique_ptr< FourBlockTree > construct(const Graph &g, adjEntry externalFace)
Construct a 4-block tree of the given graph.
NodeArray< node > originalNodes
The nodes in the original graph corresponding to the nodes in g.
Decralation of GraphElement and GraphList classes.
Declares class GraphIO which provides access to all graph read and write functionality.
Declaration of FourBlockTree.
node firstNode() const
Returns the first node in the list of all nodes.
Data type for general directed graphs (adjacency list representation).
static const long nodeLabel
Corresponds to node attribute label(node).
adjEntry cyclicSucc() const
Returns the cyclic successor in the adjacency list.
A node in a 4-block tree.
static const long edgeGraphics
Corresponds to edge attribute bends(edge).
adjEntry firstAdj() const
Returns the first entry in the adjaceny list.
adjEntry externalFace
A half-edge in g such that the external face of g is to its right.
Implementation of the Planar-Straight layout algorithm.
std::string to_string(const std::function< std::ostream &(std::ostream &)> &func)
Class for the representation of nodes.
static const long nodeGraphics
Corresponds to node attributes x(node), y(node), width(node), height(node), and shape(node).
void randomPlanarConnectedGraph(Graph &G, int n, int m)
Creates a random connected (simple) planar (embedded) graph.
const string & label(node v) const
Returns the label of node v.