xephtar commented on issue #2187: URL: https://github.com/apache/age/issues/2187#issuecomment-2965346631
Our graph is directed and connected, with relationships like A -> X or A -> Y. When we perform a directed search starting from node X, we can't reach its second-level neighbors by jumping across relationships, since the traversal only follows the direction of the edges. However, the reason we consider making the graph undirected is because there are nodes directly connected to X, but those nodes are also connected to other labels via outgoing relationships. In this case, due to the direction, we miss some relevant connections during traversal. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: dev-unsubscr...@age.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org
