I have some rectangles A,B,C,D,...
I wan to place them in a bigger rectangle Z, how to minimize area of Z?
where I say place I mean make Z cover A,cover B cover all others,
but A,B,.. should not overlap.
also the position of A,B,C...is not important u can even rotate the
rectangles to get
No, longest path isn't that easy. We can find the Halminton path as well as
the longest path, but...
On 6/20/07, Muntasir Khan [EMAIL PROTECTED] wrote:
On 6/20/07, mirchi [EMAIL PROTECTED] wrote:
can anyone please tell me how to find
single source longest path in a directed acyclic
