I have a problem with graph traversal. My use case is not resolved using typical graph traversal algorithms (DFS, BFS). I want intersection nodes starting with a specific Node ( N ), where edge is of type ET . I want to get all nodes with and with a course from N to node. This is possible using one of the Orient strategies, but I want to have all the possible paths - not just one.
Example:

For the above chart, there are two ways from R to C :
My graphs may be a little larger, but the idea is the same.
In the OrientDB documentation, I found that there is a method on Graph that returns all edges ( getEdgesofClass(String class) ). I thought I could solve my problem. If I could somehow indicate the graph (the subgraph of the main nodes - only the nodes associated with the Root node) that I want to call this method.
Thanks for all the input.
graph-traversal orientdb
goral
source share