Fabio Lorenzi created TINKERPOP-2230:
----------------------------------------
Summary: match() step unexpected behaviours
Key: TINKERPOP-2230
URL: https://issues.apache.org/jira/browse/TINKERPOP-2230
Project: TinkerPop
Issue Type: Bug
Affects Versions: 3.4.1
Reporter: Fabio Lorenzi
On the well known software graph:
{code:java}
gremlin> g.V().match(
......1> __.as('a').out('knows').as('b'),
......2> __.as('b').out('created').as('c'))
==>[a:v[1],b:v[4],c:v[5]]
==>[a:v[1],b:v[4],c:v[3]]
gremlin> g.V().match(
......1> __.as('b').out('created').as('c'),
......2> __.as('a').out('knows').as('b'))
The provided match pattern is unsolvable: [[MatchStartStep(a),
VertexStep(OUT,[knows],vertex), MatchEndStep(b)], [MatchStartStep(b),
VertexStep(OUT,[created],vertex), MatchEndStep(c)]]
{code}
with the second one being solvable as well (I think). (?)
Quoting [~dkuppitz]:
"I just noticed that the error message of my failing traversal actually
contains a solvable form of patterns. It's really confusing; if you want,
create a Jira ticket for that issue, perhaps someone dares to analyze that
crazy code"
please see
[this|https://stackoverflow.com/questions/56218188/match-clause-is-unsolvable-behavior-is-not-clear/56260508#56260508]
for more information.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
