Matching all nodes related to a set of other nodes
I'm just getting started with neo4j and would like some help trying to solve a problem.
I have a set of
Questions that require information (
Slots) to answer them.
The rules of the graph (i.e. the
required for each
Question) are shown below:
graph LR C[QUESTION 1] -- requires --> E[SLOT A] C-- requires --> F[SLOT B] G[QUESTION 2] -- requires --> E G -- requires --> H[SLOT C]
In a scenario in which I have a set of slots e.g. [
Slot B] I want to be able to check all
Questions that the
Slots are related to e.g. [
Question 1 ,
I then want to be able to check for which of the
Slots are available, e.g. [
Is this possible, and if so how should I go about it?