[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: graph layout
From: |
Vic Bancroft |
Subject: |
Re: graph layout |
Date: |
Mon, 7 Apr 2003 08:33:40 -0400 (EDT) |
On Sat, 5 Apr 2003, [iso-8859-2] Patryk Wo?niak wrote:
> I am a student of Wroclaw institute of technology (engineering college).
> (POLAND) I need simple code (in GNU Prolog) solving problem "Graph layout"
> (less than 20 points).
That sounds like fun. The standard approaches for prolog would use a recursive
algorithm, but here would be an interesting one to implement :
http://www.cs.panam.edu/info_vis/spr_tr.html
Can you think of a way to use finite domain constraints for this ?
> Can you help me?
Sure.
more,
l8r,
-------------------------------------------------------------------
Victor Bancroft, Principal Engineer, Zvolve Systems [v]770.551.4505
1050 Crown Pointe Pkwy, Suite 300, Atlanta GA 30338 [f]770.551.4509
Fellow, Artificial Intelligence Center [v]706.542-0358
Athens, Georgia 30602, U.S.A http://ai.uga.edu/~bancroft
- graph layout, Patryk Woźniak, 2003/04/06
- Re: graph layout,
Vic Bancroft <=