/** * Initialize the embeddings from the given edge triples. * * @param t edge triple candidates for the first step in the traversal * @return initial embeddings */ DataSet<EmbeddingWithTiePoint<K>> buildInitialEmbeddings(DataSet<TripleWithCandidates<K>> t) { return t .filter(new TripleHasCandidate<>((int) getTraversalCode().getStep(0).getVia())) .flatMap(new BuildEmbeddingFromTriple<>(getKeyClazz(), getTraversalCode(), getMatchStrategy(), getVertexCount(), getEdgeCount())); } }
/** * Initialize the embeddings from the given edge triples. * * @param t edge triple candidates for the first step in the traversal * @return initial embeddings */ DataSet<EmbeddingWithTiePoint<K>> buildInitialEmbeddings(DataSet<TripleWithCandidates<K>> t) { return t .filter(new TripleHasCandidate<>((int) getTraversalCode().getStep(0).getVia())) .flatMap(new BuildEmbeddingFromTriple<>(getKeyClazz(), getTraversalCode(), getMatchStrategy(), getVertexCount(), getEdgeCount())); } }
.flatMap(new ExpandFrequentPatterns());
.flatMap(new ExpandFrequentPatterns());
.flatMap(new ValidateNeighborhood(getQuery()));
.flatMap(new ValidateNeighborhood(getQuery()));
.getEdges() .filter(edgeFilterFunction) .flatMap(new ElementIdGraphIdTuple<>()) .join(graphIdDictionary) .where(1)
.getEdges() .filter(edgeFilterFunction) .flatMap(new ElementIdGraphIdTuple<>()) .join(graphIdDictionary) .where(1)
.flatMap(new ValidateNeighborhood(getQuery())) .groupBy(0) .combineGroup(new CombinedMessages())
.flatMap(new ValidateNeighborhood(getQuery())) .groupBy(0) .combineGroup(new CombinedMessages())
collection.getVertices() .filter(vertexFilterFunction) .flatMap(new ElementIdGraphIdTuple<>()) .join(graphIdDictionary) .where(1)
collection.getVertices() .filter(vertexFilterFunction) .flatMap(new ElementIdGraphIdTuple<>()) .join(graphIdDictionary) .where(1)