new algos for STRAIGHT_LINE_EMBEDDING

Article View: comp.lang.c++.leda

Article #129

Back to comp.lang.c++.leda Previous Next

#129

From: Winfried Stenzel
Date: Thu, 12 Oct 1995 13:11

20 lines
1122 bytes

Hallo graph algorithm experts,

I just took the version LEDA-3.2.3 and I found 3 new algorithms for
drawing graphs by straight lines, which are not described in the manual.

In the file LEDA/src/_new_embed.c there's a function:
int STRAIGHT_LINE_EMBEDDING2(graph& G,node_array<int>& xcoord,
				     node_array<int>& ycoord)

In the file LEDA/src/_schnyder.c, there are:
int STRAIGHT_LINE_EMBEDDING2(graph& G,
			     node& a, node& b, node& c,
			  node_array<int>& xcoord,
		       node_array<int>& ycoord)
int STRAIGHT_LINE_EMBEDDING2(graph& G,node_array<double>& x, node_array<double>& y)

What algorithms do they implement and where can I find the references?

Thanks
Winni

Technical Details

Message-ID: <45j46s$ja7@rznews.rrze.uni-erlangen.de>

Path: arc1-ca.pugleaf.net!cip.informatik.uni-erlangen.de!wdstenze

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!cip.informatik.uni-erlangen.de!wdstenze
From: wdstenze@cip.informatik.uni-erlangen.de (Winfried Stenzel)
Newsgroups: comp.lang.c++.leda
Subject: new algos for STRAIGHT_LINE_EMBEDDING
Date: 12 Oct 1995 13:11:56 GMT
Organization: Student Pool, CSD., University of Erlangen
Message-ID: <45j46s$ja7@rznews.rrze.uni-erlangen.de>
NNTP-Posting-Host: faui04a.informatik.uni-erlangen.de
NNTP-Posting-User: wdstenze