I feel this should be a basic question, but for the life of me can’t figure out a reliable way to do this - I apologize if this has been answered elsewhere, my searches haven’t seemed to turn up any relevant results so any help would be greatly appreciated.
I have two lists of sublists (list1 and list2) and I would like to identify the matching sublists as their own new lists, as well as the sublists that are in list1 but not in list2 and vice versa. The individual items in the lists are identical, but they may be grouped into the sublists differently, and the sublists may be in a different order.
I have simplified this problem into the example graph below.
It seems as though the List.SetIntersection node does not work in comparing sublists. I have also tried various permutations of List.AllIndicesOf and List.Contains but get bogged down with the different Level and Lacing options.
Thank you in advance for any advice!
Find Matching Lists in Lists.dyn (17.5 KB)