You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@tinkerpop.apache.org by "Marc de Lignie (JIRA)" <ji...@apache.org> on 2017/12/10 13:16:00 UTC

[jira] [Updated] (TINKERPOP-1852) Recipe fails for highly meshed connected components

     [ https://issues.apache.org/jira/browse/TINKERPOP-1852?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Marc de Lignie updated TINKERPOP-1852:
--------------------------------------
    Description: On the JanusGraph user list the connected-components recipe was shown to fail for a completely meshed component with a size of 35. The successive thread [https://groups.google.com/forum/#!topic/janusgraph-users/NmwZyag1w2M] shows a better, though mixed groovy-gremlin recipe. A pure gremlin solution along the lines provided probably exists. In particaluar I did not try group('m').by().by() yet to store components with (k,v) = (vertex, list of vertices per component).  (was: On the JanusGraph user list the connected-components recipe was shown to fail for a completely meshed component with a size of 35. The successive thread[https://groups.google.com/forum/#!topic/janusgraph-users/NmwZyag1w2M] shows a better, though mixed groovy-gremlin recipe. A pure gremlin solution along the lines provided probably exists. In particaluar I did not try group('m').by().by() yet to store components with (k,v) = (vertex, list of vertices per component).)

> Recipe fails for highly meshed connected components
> ---------------------------------------------------
>
>                 Key: TINKERPOP-1852
>                 URL: https://issues.apache.org/jira/browse/TINKERPOP-1852
>             Project: TinkerPop
>          Issue Type: Bug
>          Components: documentation
>    Affects Versions: 3.3.0, 3.2.6
>         Environment: gremlin-console
>            Reporter: Marc de Lignie
>            Priority: Minor
>
> On the JanusGraph user list the connected-components recipe was shown to fail for a completely meshed component with a size of 35. The successive thread [https://groups.google.com/forum/#!topic/janusgraph-users/NmwZyag1w2M] shows a better, though mixed groovy-gremlin recipe. A pure gremlin solution along the lines provided probably exists. In particaluar I did not try group('m').by().by() yet to store components with (k,v) = (vertex, list of vertices per component).



--
This message was sent by Atlassian JIRA
(v6.4.14#64029)