[
https://issues.apache.org/jira/browse/TINKERPOP-1967?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16505204#comment-16505204
]
stephen mallette commented on TINKERPOP-1967:
---------------------------------------------
I guess you just need to set {{VertexProgramStrategy.WORKERS}} in the
configuration like in {{TinkerGraphComputerProvider}} in the tests:
{code}
graph.traversal().withStrategies(VertexProgramStrategy.create(new
MapConfiguration(new HashMap<String, Object>() {{
put(VertexProgramStrategy.WORKERS,
RANDOM.nextInt(Runtime.getRuntime().availableProcessors()) + 1);
put(VertexProgramStrategy.GRAPH_COMPUTER, RANDOM.nextBoolean() ?
GraphComputer.class.getCanonicalName() :
TinkerGraphComputer.class.getCanonicalName());
}})));
{code}
> I saw that the ClusterCountMapReduce and ClusterPopulationMapReduce classes
> are not usable for the ConnectedComponentVertexProgram.
tbh, i wasn't sure that i saw the point of making similar classes as i was
mostly thinking about {{connectedComponent()}} step usage. Do you think those
should be made available for some reason?
> Add a connectedComponent() step
> -------------------------------
>
> Key: TINKERPOP-1967
> URL: https://issues.apache.org/jira/browse/TINKERPOP-1967
> Project: TinkerPop
> Issue Type: Improvement
> Components: process
> Affects Versions: 3.3.3
> Reporter: stephen mallette
> Assignee: stephen mallette
> Priority: Minor
> Fix For: 3.4.0
>
>
> Given TINKERPOP-1852 we should probably just simplify and improve performance
> of connected component identification. Implementing this will involved the
> creation of {{ConnectedComponentVertexProgram}}.
--
This message was sent by Atlassian JIRA
(v7.6.3#76005)
