Skip to content

Commit e7eda51

Browse files
IoannisPanagiotasIoannisPanagiotas
committed
Do for spanning tree
1 parent dec5e8a commit e7eda51

File tree

3 files changed

+219
-3
lines changed

3 files changed

+219
-3
lines changed

‎procedures/pushback-procedures-facade/src/main/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/SpanningTreeWriteResultTransformer.java‎

Lines changed: 93 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,93 @@
1+
/*
2+
* Copyright (c) "Neo4j"
3+
* Neo4j Sweden AB [http://neo4j.com]
4+
*
5+
* This file is part of Neo4j.
6+
*
7+
* Neo4j is free software: you can redistribute it and/or modify
8+
* it under the terms of the GNU General Public License as published by
9+
* the Free Software Foundation, either version 3 of the License, or
10+
* (at your option) any later version.
11+
*
12+
* This program is distributed in the hope that it will be useful,
13+
* but WITHOUT ANY WARRANTY; without even the implied warranty of
14+
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15+
* GNU General Public License for more details.
16+
*
17+
* You should have received a copy of the GNU General Public License
18+
* along with this program. If not, see <http://www.gnu.org/licenses/>.
19+
*/
20+
package org.neo4j.gds.procedures.algorithms.pathfinding.write;
21+
22+
import org.neo4j.gds.api.Graph;
23+
import org.neo4j.gds.api.GraphStore;
24+
import org.neo4j.gds.api.ResultStore;
25+
import org.neo4j.gds.applications.algorithms.metadata.RelationshipsWritten;
26+
import org.neo4j.gds.core.utils.ProgressTimer;
27+
import org.neo4j.gds.core.utils.progress.JobId;
28+
import org.neo4j.gds.pathfinding.SpanningTreeWriteStep;
29+
import org.neo4j.gds.procedures.algorithms.pathfinding.SpanningTreeWriteResult;
30+
import org.neo4j.gds.result.TimedAlgorithmResult;
31+
import org.neo4j.gds.results.ResultTransformer;
32+
import org.neo4j.gds.spanningtree.SpanningTree;
33+
34+
import java.util.Map;
35+
import java.util.concurrent.atomic.AtomicLong;
36+
import java.util.stream.Stream;
37+
38+
public class SpanningTreeWriteResultTransformer implements ResultTransformer<TimedAlgorithmResult<SpanningTree>, Stream<SpanningTreeWriteResult>> {
39+
40+
private final SpanningTreeWriteStep writeStep;
41+
private final Graph graph;
42+
private final GraphStore graphStore;
43+
@Deprecated(forRemoval = true)
44+
private final ResultStore resultStore;
45+
private final JobId jobId;
46+
private final Map<String, Object> configuration;
47+
48+
public SpanningTreeWriteResultTransformer(
49+
SpanningTreeWriteStep writeStep,
50+
Graph graph,
51+
GraphStore graphStore,
52+
ResultStore resultStore,
53+
JobId jobId,
54+
Map<String, Object> configuration
55+
) {
56+
this.writeStep = writeStep;
57+
this.graph = graph;
58+
this.graphStore = graphStore;
59+
this.resultStore = resultStore;
60+
this.jobId = jobId;
61+
this.configuration = configuration;
62+
}
63+
64+
@Override
65+
public Stream<SpanningTreeWriteResult> apply(TimedAlgorithmResult<SpanningTree> algorithmResult) {
66+
67+
RelationshipsWritten relationshipsWritten;
68+
var writeMillis = new AtomicLong();
69+
var result = algorithmResult.result();
70+
try (var ignored = ProgressTimer.start(writeMillis::set)) {
71+
relationshipsWritten = writeStep.execute(
72+
graph,
73+
graphStore,
74+
resultStore,
75+
result,
76+
jobId
77+
);
78+
}
79+
80+
return Stream.of(
81+
new SpanningTreeWriteResult(
82+
0,
83+
algorithmResult.computeMillis(),
84+
writeMillis.get(),
85+
result.effectiveNodeCount(),
86+
relationshipsWritten.value(),
87+
result.totalWeight(),
88+
configuration
89+
)
90+
);
91+
}
92+
93+
}

‎procedures/pushback-procedures-facade/src/main/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/SpanningTreeWriteResultTransformerBuilder.java‎

Lines changed: 19 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -31,10 +31,26 @@
3131
import java.util.stream.Stream;
3232

3333
class SpanningTreeWriteResultTransformerBuilder implements ResultTransformerBuilder<TimedAlgorithmResult<SpanningTree>, Stream<SpanningTreeWriteResult>> {
34-
SpanningTreeWriteResultTransformerBuilder(SpanningTreeWriteStep writeStep, SpanningTreeWriteConfig config) {}
34+
35+
private final SpanningTreeWriteConfig config;
36+
private final SpanningTreeWriteStep writeStep;
37+
38+
SpanningTreeWriteResultTransformerBuilder(
39+
SpanningTreeWriteStep writeStep,
40+
SpanningTreeWriteConfig config
41+
) {
42+
this.writeStep = writeStep;
43+
this.config = config;
44+
}
3545

3646
@Override
3747
public ResultTransformer<TimedAlgorithmResult<SpanningTree>, Stream<SpanningTreeWriteResult>> build(GraphResources graphResources) {
38-
return ar -> Stream.empty();
39-
}
48+
return new SpanningTreeWriteResultTransformer(
49+
writeStep,
50+
graphResources.graph(),
51+
graphResources.graphStore(),
52+
graphResources.resultStore(),
53+
config.jobId(),
54+
config.toMap()
55+
); }
4056
}

‎procedures/pushback-procedures-facade/src/test/java/org/neo4j/gds/procedures/algorithms/pathfinding/write/SpanningTreeWriteResultTransformerTest.java‎

Lines changed: 107 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,107 @@
1+
/*
2+
* Copyright (c) "Neo4j"
3+
* Neo4j Sweden AB [http://neo4j.com]
4+
*
5+
* This file is part of Neo4j.
6+
*
7+
* Neo4j is free software: you can redistribute it and/or modify
8+
* it under the terms of the GNU General Public License as published by
9+
* the Free Software Foundation, either version 3 of the License, or
10+
* (at your option) any later version.
11+
*
12+
* This program is distributed in the hope that it will be useful,
13+
* but WITHOUT ANY WARRANTY; without even the implied warranty of
14+
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15+
* GNU General Public License for more details.
16+
*
17+
* You should have received a copy of the GNU General Public License
18+
* along with this program. If not, see <http://www.gnu.org/licenses/>.
19+
*/
20+
package org.neo4j.gds.procedures.algorithms.pathfinding.write;
21+
22+
import org.junit.jupiter.api.Test;
23+
import org.neo4j.gds.api.Graph;
24+
import org.neo4j.gds.api.GraphStore;
25+
import org.neo4j.gds.api.ResultStore;
26+
import org.neo4j.gds.applications.algorithms.metadata.RelationshipsWritten;
27+
import org.neo4j.gds.core.utils.progress.JobId;
28+
import org.neo4j.gds.pathfinding.SpanningTreeWriteStep;
29+
import org.neo4j.gds.result.TimedAlgorithmResult;
30+
import org.neo4j.gds.spanningtree.SpanningTree;
31+
32+
import java.util.Map;
33+
34+
import static org.assertj.core.api.Assertions.assertThat;
35+
import static org.mockito.ArgumentMatchers.any;
36+
import static org.mockito.Mockito.mock;
37+
import static org.mockito.Mockito.times;
38+
import static org.mockito.Mockito.verify;
39+
import static org.mockito.Mockito.verifyNoMoreInteractions;
40+
import static org.mockito.Mockito.when;
41+
42+
class SpanningTreeWriteResultTransformerTest {
43+
44+
@Test
45+
void shouldTransformToWriteResult() {
46+
var config = Map.<String, Object>of("foo", "bar");
47+
var graph = mock(Graph.class);
48+
var graphStore = mock(GraphStore.class);
49+
var resultStore = mock(ResultStore.class);
50+
var jobId = new JobId();
51+
var writeStep = mock(SpanningTreeWriteStep.class);
52+
53+
var algoResult = mock(SpanningTree.class);
54+
when(algoResult.effectiveNodeCount()).thenReturn(1L);
55+
when(algoResult.totalWeight()).thenReturn(3d);
56+
57+
var relationshipsWritten = new RelationshipsWritten(5L);
58+
when(writeStep.execute(any(), any(), any(), any(), any())).thenReturn(relationshipsWritten);
59+
60+
var timedResult = new TimedAlgorithmResult<>(algoResult, 123L);
61+
62+
var transformer = new SpanningTreeWriteResultTransformer(writeStep, graph, graphStore, resultStore, jobId, config);
63+
64+
var resultStream = transformer.apply(timedResult);
65+
var result = resultStream.findFirst().orElseThrow();
66+
67+
assertThat(result.preProcessingMillis()).isZero();
68+
assertThat(result.computeMillis()).isEqualTo(123L);
69+
assertThat(result.writeMillis()).isNotNegative();
70+
assertThat(result.configuration()).isEqualTo(config);
71+
assertThat(result.effectiveNodeCount()).isEqualTo(1L);
72+
assertThat(result.totalWeight()).isEqualTo(3d);
73+
74+
assertThat(result.relationshipsWritten()).isEqualTo(5L);
75+
76+
verify(writeStep, times(1)).execute(graph, graphStore, resultStore, algoResult, jobId);
77+
verifyNoMoreInteractions(writeStep);
78+
}
79+
80+
@Test
81+
void shouldTransformEmptyResultToWriteResult() {
82+
var config = Map.<String, Object>of("boo", "foo");
83+
var graph = mock(Graph.class);
84+
var graphStore = mock(GraphStore.class);
85+
var resultStore = mock(ResultStore.class);
86+
var jobId = new JobId();
87+
var writeStep = mock(SpanningTreeWriteStep.class);
88+
when(writeStep.execute(any(), any(), any(), any(), any())).thenReturn(new RelationshipsWritten(0L));
89+
90+
var algoResult = SpanningTree.EMPTY;
91+
92+
var timedResult = new TimedAlgorithmResult<>(algoResult, 123L);
93+
94+
var transformer = new SpanningTreeWriteResultTransformer(writeStep, graph, graphStore, resultStore, jobId, config);
95+
96+
var resultStream = transformer.apply(timedResult);
97+
var result = resultStream.findFirst().orElseThrow();
98+
99+
assertThat(result.preProcessingMillis()).isZero();
100+
assertThat(result.computeMillis()).isEqualTo(123L);
101+
assertThat(result.writeMillis()).isNotNegative();
102+
assertThat(result.configuration()).isEqualTo(config);
103+
assertThat(result.effectiveNodeCount()).isEqualTo(0L);
104+
assertThat(result.totalWeight()).isEqualTo(0d);
105+
assertThat(result.relationshipsWritten()).isEqualTo(0);
106+
}
107+
}

0 commit comments

Comments
 (0)