Having an array of N sets, what is the fastest way to generate the inclusion graph of these sets?
Having an array of N sets, what is the fastest way to generate the
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Having an array of N sets, what is the fastest way to generate the inclusion graph of these sets?
If you have a set of N sets none of which contain another, all of the same size, you are going to need to do N^2 set comparisons.