new algos for STRAIGHT_LINE_EMBEDDING

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

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Winfried Stenzel Thu, 12 Oct 1995 13:11

#129

Author: 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

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads