Hi,
My graph looks something like this (length can be longer). What I need is all the different and distinct branches, eg {A,B,E,J}, {A,C,F,K}, {A,D,G,L}, {A,H,I.M}

My idea so far is an in-loop starting from A, get all the paths, but among them I receive as well the intermediary ones:
eg. The orange path is not needed. I need just the complete, final paths.
==>[v[768], v[1792]]
==>[v[768], v[1536]]
==>[v[768], v[1792], v[2048]]
That's my query: g.V.has('someProp','A').as('x').in.loop('x'){it.loops<100}{true}.path()
Any idea how I could do this with path()? And if it's not possible, any other ideas how I could do this?
Thank you,
Andrei