set_theory | Extends Object and Array with nice names for set operations | Reflection library

I initially defined the intersection type of type DOMRectReadOnly and StyleProperties like below which results type "size" | "start" | "end".

I have a networkx.Graph object representing a graph whose nodes represent English words, and whose edges between two wnodes imply that the two words that those nodes represent have at least one shared cognitive synonym between their synsets (i.e. a non-empty intersection). I hope that is interesting or useful background to someone, but my problem is a more widely applicable one relating to graphs, networkx, and Python.

Many induced subgraphs (edge-induced, or vertex-induced) of this graph are both edge disjoint and vertex disjoint, and I'd like to separate these subgraphs into their own networkx.Graph objects such that they're connected and mutually disjoint. It is possible that I'm just using the wrong search terms for the networkx documentation, but I didn't see anything promising related to "disjoint". Here are some examples from a tiny portion of the graph.

I looked through the search results for [networkx] disjoint on Stack Overflow and didn't see what I was looking for. For example, one result talked about getting the induced subgraph when there's already have an edge set to induce from. Or another post talked about trying to draw two disjoint graphs, but that's assuming you already have them. Related to the graph theory aspect of my question, but not the networkx aspect, is that apparently there's such a thing as a flood fill algorithm that might address the part of my question.

Now, for a minimum working example, let's create a small random graph but ensure that it is disconnected.

I found many resources on how to draw Venn diagrams in R. Stack Overflow has a lot of them. However, I still can't draw my diagrams the way I want. Take the following code as an example:

I want to create a type which will error if the same property is defined as in another type. This is to build a type safe merge (perhaps there already is one?) The following works but I'm wondering if there's a better approach? Will there be edge cases here that the implementation doesn't handle?

I have a keyed data.table to which I would like to add rows from another table of the same key:

I need to find out if there is any intersection between two arrays with start and end value (wiki on this https://en.wikipedia.org/wiki/Intersection_(set_theory)). For example (just a few cases):

I have to retrieve the values that exist only on Array B, but do not exist on Array A.

From my research, It is called:

relative complement of A in B

Values in the arrays may not be primitives.I need an efficient and functional apporach to this problem. I have found lodash _.without function, but it supports only array of primitive numbers.

Array A: