|
The predicates But is there a way, to write a dataflow query that identify a partial path from the source to a sink with one or two missing steps? I mean something with |
Answered by
alexet
Feb 15, 2023
Replies: 1 comment
|
Hi In general this is not possible. The problem is that there could always be a step that goes from any node reachable from the source to a node reachable in the sink so all places are theoretically reachable in 1 hop. |
0 replies
Answer selected by
Sim4n6
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Hi
In general this is not possible. The problem is that there could always be a step that goes from any node reachable from the source to a node reachable in the sink so all places are theoretically reachable in 1 hop.