slygren Comments - Answer Overflow

This seems to be working g.V().has('lbl', 'DexpiElement').has('tagname', 'tagA') .repeat( bothE().has('lbl', within('HAS_CHILD', 'HAS_CONNECTION', 'HAS_NODE', 'CONNECTED_TO', 'MAIN_CONNECTED_FROM', 'MAIN_CONNECTED_TO')).dedup().otherV().simplePath() ) .until(has('lbl', 'DexpiElement').has('tagname', 'tagB')) .path() .unfold() .has('lbl','DexpiElement') .as('e') .project('element', 'child') .by(outE().has('lbl', 'HAS_GRAPHICS').inV().has('lbl', 'DexpiElementGraphic').as('eg').select('e','eg').by('dexpi_id').by(valueMap()).fold()) .by(outE().has('lbl', 'HAS_CHILD').inV().has('lbl', 'DexpiElement').as('ce').outE().has('lbl', 'HAS_GRAPHICS').inV().has('lbl', 'DexpiElementGraphic').as('cg').select('ce','cg').by('dexpi_id').by(valueMap()).fold())

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

wouldn't bet my life on it, but yes there's no sharing of labels between the two

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

the unfold to path results in both vertices and edges though, any way to filter only vertices to continue on, or again no need to?

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

ok, got it - trying to get my head around how to interpret the outcomes of the different steps

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

therefore I tried to collect the ids in a list to be used in a within statement

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

I get the strange part to it yes, unsure how to approach the query. What I'm aiming for is to get the path(s) between to vertices and then for each of the DexpiElements in this/these paths do do a further traversal off each of them to reach some child vertices

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

got this far, but unsure how to do the within g

.V().has('lbl', 'DexpiElement').has('tagname', 'A-20PSV0100')
    .repeat(
        bothE().has('lbl', within('HAS_CHILD', 'HAS_CONNECTION', 'HAS_NODE', 'CONNECTED_TO', 'MAIN_CONNECTED_FROM', 'MAIN_CONNECTED_TO')).dedup().otherV().simplePath()
    )
    .until(has('lbl', 'DexpiElement').has('tagname', 'A-20LV0011'))
    .path()
    .unfold()
    .where(values('dexpi_id'))
    .values('dexpi_id')
    .fold()
    .as('ids')
    .V().has('lbl', 'DexpiElement').has('dexpi_id', within(select('ids')))

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

@flynnt_1337 a followup question - is there some way to access each DexpiElement of the resulting path, add their id's to a list for then to do further traversals?

28 replies

JJanusGraph

•Created by slygren on 8/2/2023 in #questions

Find all paths between two vertices

Perfect! Thanks a bunch

28 replies

JJanusGraph

•Created by rydbirkjr on 6/27/2023 in #questions

Upgrading from 0.6 to 1.0.0-20230626 caused indexes to disappear

@florianhockmann - you're correct - my issue seems to be related to transactions and consistency using ScyllaDB as a backend

8 replies

JJanusGraph

•Created by rydbirkjr on 6/27/2023 in #questions

Upgrading from 0.6 to 1.0.0-20230626 caused indexes to disappear

Probably some of the same I'm experiencing here! On 1.0 RC2 I've created indexes and can verify them being ENABLEd and used (checked .profile()) however - doing a simple g.V().has('someindex', 'somevalue').count() turns out 0 as if the 'someindex' property does not seem to exist (while it does).

8 replies

Gaming

Programming