Graph Drawing Algorithms (graph_draw)

This section gives a summary of the graph drawing algorithms contained in LEDA. Before using them the header file <LEDA/graph_draw.h> has to be included.

int	STRAIGHT_LINE_EMBEDDING(graph& G, node_array<int>& xcoord, node_array<int>& ycoord)
		STRAIGHT_LINE_EMBEDDING takes as argument a directed graph G representing a planar map. It computes a straight line embedding of G by assigning non-negative integer coordinates (xcoord and ycoord) in the range 0..2(n-1) to the nodes. STRAIGHT_LINE_EMBEDDING returns the maximal coordinate. The algorithm ([28]) has running time O(|V|^2).
bool	TUTTE_EMBEDDING(graph G, list<node> fixed_nodes, node_array<double>& xpos, node_array<double>& ypos)
		computes a convex drawing of the graph G if possible. The list fixed_nodes contains nodes with prescribed coordinates already given in xpos and ypos. The computed node positions of the other nodes are stored in xpos and ypos, too. If the operation is successful, true is returned.
void	SPRING_EMBEDDING(graph G, node_array<double>& xpos, node_array<double>& ypos, double xleft, double xright, double ybottom, double ytop, int iterations=250)
		...
void	SPRING_EMBEDDING(graph G, list<node> fixed, node_array<double>& xpos, node_array<double>& ypos, double xleft, double xright, double ybottom, double ytop, int iterations=250)
		...
int	ORTHO_EMBEDDING(graph, node_array<int>& , node_array<int>& , edge_array<list<int> >& , edge_array<list<int> >& , bool= false)
		orthoganal embedding with bend minimization implementation by G. Klau (MPI Saarbrücken), the final version will be part of the AGD Graph Drawing Library.