I have a graph that generally looks like this:
(:A)-[:HAS_B]->(:B)-[:HAS_C]->(:C)
And, :B represents a kind of "study" that was done that yielded some result. So, as quite often is the case, there are many B's for each A/C pairing.
What I'd like to ...