Originally Posted by
viswastone
Hi
I have the following structure. I have 5 files. Each file can have n number of files. Totally i have 10 subfiles. Now, i want to find the minimum number of Files so that all subfiles will be included.
For eg:
File Sub Files
A 1 2 3 8
B 2 4 6 10
C 1 3 5 7 8 9
D 7 9 10
E 1 3 7 9
If i combine B and C all the 10 subfiles will be handled. 1,2,3,4,5,6,7,8,9,10.
I think that is the minimun combination to cover all sub files. Is there any algoirthm to find this? Actually in my problem to develop a tool, I can have n number of files and n number of subfiles. Please tell me how to find the minimum number of files required to cover all the files. Which concept can be used for this case ?
Thanks.