Consider having the following graph. There's 3 types of nodes (A,B,C) where type C has the property "Traversable" with the values "true" or "false".
I would like to create a named graph (or subgraph) that includes type C nodes depending on the value of "Traversable" as well as the position in the graph.
Let's say the nodes are structured like this (with "-" for relationships between them):
Here, I'd like to include all nodes of type A and B. If a node of type C is in the middle of the path (not first C or last C), it should be excluded if the field "Traversable" has the value "false" (and included if true). The node in question is the C-node with parenthesis around it.
How can I make a named graph/subgraph with this type of filter?
If possible, it would also be desirable to include another filter on another property. I'm thinking something like
MATCH (n) WHERE n.GROUP = 1
and then the C-node filter mentioned above.
The purpose here is to use Yen's algorithm on the mentioned subgraph so if there's any possible solution that enables it through a configuration of Yen's, it's very welcomed.
Neo4j browser version 4.2.3
GDS version 1.6.1
APOC version 22.214.171.124