/
CollectionEquality.java
68 lines (63 loc) · 2.75 KB
/
CollectionEquality.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*
* Copyright © 2014 - 2019 Leipzig University (Database Research Group)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.gradoop.flink.model.impl.operators.equality;
import org.apache.flink.api.java.DataSet;
import org.gradoop.common.model.impl.pojo.Edge;
import org.gradoop.common.model.impl.pojo.GraphHead;
import org.gradoop.common.model.impl.pojo.Vertex;
import org.gradoop.flink.model.impl.epgm.GraphCollection;
import org.gradoop.flink.model.api.operators.BinaryCollectionToValueOperator;
import org.gradoop.flink.model.impl.functions.bool.Equals;
import org.gradoop.flink.model.impl.operators.tostring.CanonicalAdjacencyMatrixBuilder;
import org.gradoop.flink.model.impl.operators.tostring.api.EdgeToString;
import org.gradoop.flink.model.impl.operators.tostring.api.GraphHeadToString;
import org.gradoop.flink.model.impl.operators.tostring.api.VertexToString;
/**
* Operator to determine if two graph collections are equal according to given
* string representations of graph heads, vertices and edges.
*/
public class CollectionEquality
implements BinaryCollectionToValueOperator<Boolean> {
/**
* builder to create the string representations of graph collections used for
* comparison.
*/
private final CanonicalAdjacencyMatrixBuilder canonicalAdjacencyMatrixBuilder;
/**
* constructor to set string representations
* @param graphHeadToString string representation of graph heads
* @param vertexToString string representation of vertices
* @param edgeToString string representation of edges
* @param directed sets mode for directed or undirected graphs
*/
public CollectionEquality(GraphHeadToString<GraphHead> graphHeadToString,
VertexToString<Vertex> vertexToString, EdgeToString<Edge> edgeToString,
boolean directed) {
/*
sets mode for directed or undirected graphs
*/
this.canonicalAdjacencyMatrixBuilder = new CanonicalAdjacencyMatrixBuilder(
graphHeadToString, vertexToString, edgeToString, directed);
}
@Override
public DataSet<Boolean> execute(GraphCollection firstCollection,
GraphCollection secondCollection) {
return Equals.cross(
canonicalAdjacencyMatrixBuilder.execute(firstCollection),
canonicalAdjacencyMatrixBuilder.execute(secondCollection)
);
}
}