Build a graph in which each box is a vertex and there is an edge from A to B if B can fit inside A. Then use the longest path algorithm to find the solution. Don
On Mar 24, 1:55 am, Ratan <[email protected]> wrote: > You are given a lot of cuboid boxes with different length, breadth and > height. You need to find the maximum subset which can fit into each > other. > For example: > If Box A has LBH as 7 8 9 > If Box B has LBH as 5 6 8 > If Box C has LBH as 5 8 7 > If Box D has LBH as 4 4 4 > then answer is A,B,D > > A box can fit into another only and only if all dimensions of that is > less than the bigger box. Also Rotation of boxes is not possible... > > can ny1 suggest a good algo for this? > > -- > -- > Ratan | 3rd Year | Information Technology | NIT ALLAHABAD -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
