Re: Gremlin Query to return count for nodes and edges
|
Graham Wallis <graham_wallis@...>
Hi Vinayak
You could do this: g.V().hasLabel('A').as('a').outE().as('e').inV().as('b').select('a','e','b').by(count()) That should produce something like: ==>{a=1, e=1, b=1} Best regards, Graham Graham Wallis IBM Open Software Internet: graham_wallis@... IBM, Hursley Park, Hursley, Hampshire SO21 2JN    From: "Vinayak Bali" <vinayakbali16@...> To: janusgraph-users@... Date: 23/02/2021 09:11 Subject: [EXTERNAL] Re: [janusgraph-users] Gremlin Query to return count for nodes and edges Sent by: janusgraph-users@... Hi Marc, I am using the following query to return the results. g.V().hasLabel('A').as('a').outE().as('e').inV().as('b').select('a','e','b').by(valueMap().by(unfold())) Want the count of Hi Marc, I am using the following query to return the results. g.V().hasLabel('A').as('a').outE().as('e').inV().as('b').select('a','e','b').by(valueMap().by(unfold())) Want the count of unique nodes in a and b together and e i.e number of edges. Please modify this query to get the required output. Thanks & Regards, Vinayak On Tue, Feb 23, 2021 at 1:08 PM <hadoopmarc@...> wrote: Hi
Vinayak, Unless stated otherwise above: IBM United Kingdom Limited - Registered in England and Wales with number 741598. Registered office: PO Box 41, North Harbour, Portsmouth, Hampshire PO6 3AU |
|
|