Two users have neighbor sets A and B. What does Jaccard similarity compute?

A. The difference between their in-degrees only B. |A ∩ B| divided by |A ∪ B| C. |A| plus |B| without considering overlap D. The shortest path multiplied by graph density