[
https://issues.apache.org/jira/browse/TINKERPOP-1270?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
stephen mallette closed TINKERPOP-1270.
---------------------------------------
Resolution: Won't Do
As there hasn't been any further comment on this one after I presented the
Gremlin way of detecting incident edges, I'm going to close it. The pattern
seems fairly clear to me. If someone were to find that this approach were not
succinct enough, they could add a DSL step to allow for something like:
{{g.V(v1).edgesBetween(v2)}} which would compile down to the Gremlin above.
> A method to test two vertices inidence
> --------------------------------------
>
> Key: TINKERPOP-1270
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1270
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.1.2-incubating
> Reporter: Ondra Žižka
> Priority: Minor
>
> I'd like to be able to test an existence of an edge between two vertices:
> {code}
> boolean joined = graphContext.testIncidence(projectVertex(), archiveVertex,
> "uses");
> {code}
> Or it could give an Iterable of edges, too.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
