joyemang33 commented on issue #2142: URL: https://github.com/apache/incubator-hugegraph/issues/2142#issuecomment-1459598727
I believe that the task at hand involves counting all paths, including both simple paths and cyclic paths. Therefore, we cannot use the filter ```simplePath()``` in this case. In fact, for a graph with 10 vertices, the pigeon-hole theorem tells us that there is no simple path of length 50. Based on the task at hand, it seems that utilizing the ```simplePath()``` filter in this context may not serve any meaningful purpose. Regarding the statements about the answer being 0, I don't think that is the expected behavior. Could you please provide further support for this Gremlin query in a further release, like other GDBs? ``` gremlin> g.V().repeat(out()).times(50).dedup().count() ==> 0 gremlin> g.V().repeat(out()).times(50).count() ==> 0 ``` -- 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: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
