| /* |
| * Licensed to the Apache Software Foundation (ASF) under one or more |
| * contributor license agreements. See the NOTICE file distributed with this |
| * work for additional information regarding copyright ownership. The ASF |
| * licenses this file to You 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.apache.hugegraph.job.algorithm.cent; |
| |
| import java.util.Map; |
| |
| import org.apache.tinkerpop.gremlin.process.traversal.Operator; |
| import org.apache.tinkerpop.gremlin.process.traversal.P; |
| import org.apache.tinkerpop.gremlin.process.traversal.Pop; |
| import org.apache.tinkerpop.gremlin.process.traversal.Scope; |
| import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.GraphTraversal; |
| import org.apache.tinkerpop.gremlin.process.traversal.dsl.graph.__; |
| import org.apache.tinkerpop.gremlin.structure.Vertex; |
| |
| import org.apache.hugegraph.job.UserJob; |
| import org.apache.hugegraph.type.define.Directions; |
| |
| public class ClosenessCentralityAlgorithm extends AbstractCentAlgorithm { |
| |
| public static final long DEFAULT_DEGREE = 100L; |
| public static final long DEFAULT_SAMPLE = 1L; |
| |
| @Override |
| public String name() { |
| return "closeness_centrality"; |
| } |
| |
| @Override |
| public void checkParameters(Map<String, Object> parameters) { |
| depth(parameters); |
| } |
| |
| @Override |
| public Object call(UserJob<Object> job, Map<String, Object> parameters) { |
| try (Traverser traverser = new Traverser(job)) { |
| return traverser.closenessCentrality(direction(parameters), |
| edgeLabel(parameters), |
| depth(parameters), |
| degree(parameters), |
| sample(parameters), |
| sourceLabel(parameters), |
| sourceSample(parameters), |
| sourceCLabel(parameters), |
| top(parameters)); |
| } |
| } |
| |
| private static class Traverser extends AbstractCentAlgorithm.Traverser { |
| |
| public Traverser(UserJob<Object> job) { |
| super(job); |
| } |
| |
| public Object closenessCentrality(Directions direction, |
| String label, |
| int depth, |
| long degree, |
| long sample, |
| String sourceLabel, |
| long sourceSample, |
| String sourceCLabel, |
| long topN) { |
| assert depth > 0; |
| assert degree > 0L || degree == NO_LIMIT; |
| assert topN >= 0L || topN == NO_LIMIT; |
| |
| GraphTraversal<Vertex, Vertex> t = constructSource(sourceLabel, |
| sourceSample, |
| sourceCLabel); |
| t = constructPath(t, direction, label, degree, sample, |
| sourceLabel, sourceCLabel); |
| t = t.emit().until(__.loops().is(P.gte(depth))); |
| t = filterNonShortestPath(t, true); |
| |
| /* |
| * We use Marchiori's algorithm(sum of reciprocal of distances): |
| * .math("_-1").sack(Operator.div).sack().sum() |
| * for Bavelas's algorithm: |
| * .math("_-1").sum().sack(Operator.div).sack() |
| * see https://en.wikipedia.org/wiki/Closeness_centrality |
| */ |
| GraphTraversal<Vertex, ?> tg; |
| tg = t.group().by(__.select(Pop.first, "v").id()) |
| .by(__.select(Pop.all, "v").count(Scope.local) |
| .math("_-1").sack(Operator.div).sack().sum()); |
| GraphTraversal<Vertex, ?> tLimit = topN(tg, topN); |
| |
| return this.execute(tLimit, tLimit::next); |
| } |
| } |
| } |