Hello everyone!
We have n points in a chart that none of them have the same length(I
mean their 'x' parameter). We want to find a cycle with MINIMUM length
with these assumptions :
We start from the point with minimum length, meeting all of the points
and finally return to the starting point. We
PROTECTED]
wrote:
On Mar 30, 10:07 pm, Muntasir Azam Khan [EMAIL PROTECTED]
wrote:
- Original Message -
From: Mahdi [EMAIL PROTECTED]
To: Algorithm Geeks algogeeks@googlegroups.com
Sent: Friday, March 30, 2007 1:27 PM
Subject: [algogeeks] Sum of subsets
We have set named
hello!
It's a problem with all specifications of hanoi( 3 towers and and
ordered rings) except that rings are not all in the same tower. They
are distributed in 3 towers ( in each tower they are ordered ) and we
want to bring them all in tower C ( assuming towers A,B,C). We want
the solution with
