How can i get SHORTEST_PATH when i want to get A<----->B<----->C

[wrrgit]

When i use "FOR v IN ANY SHORTEST_PATH @_fromDbId TO @_toDbId relationOf return v" to get the shortestpath from A to C
I get that A----->B<-------C but I want to get A<----->B<----->C, what can i do use AQL to get it? i want to get the Strongly Connected Graph.
thanks for your help

[rashtao]

To find strongly connected components you can use ArangoDB Pregel: https://www.arangodb.com/docs/stable/graphs-pregel.html#connected-components

[wrrgit]

ok,thanks very much,Has it a demo?

[rashtao]

No, unfortunately it is not (yet) implemented in the Java driver.

[wrrgit]

No, unfortunately it is not (yet) implemented in the Java driver.

oh,this is very regret,but how can i do it?

[rashtao]

Here you can follow the ongoing work to document the Pregel API: arangodb/arangodb#13607
Support for it will be implemented in the Java driver once the documentation is complete.
In the meantime you can call it creating custom requests using ArangoDB.execute(Request). See https://github.com/arangodb/arangodb-java-driver/blob/f3429b2902556762ded608f069cc4caf8c603162/src/main/java/com/arangodb/ArangoDB.java#L863-L870