mirror of https://gitee.com/bigwinds/arangodb
108 lines
3.4 KiB
C++
108 lines
3.4 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
/// DISCLAIMER
|
|
///
|
|
/// Copyright 2016 ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// 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.
|
|
///
|
|
/// Copyright holder is ArangoDB GmbH, Cologne, Germany
|
|
///
|
|
/// @author Simon Grätzer
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include "LineRank.h"
|
|
#include "Pregel/Aggregator.h"
|
|
#include "Pregel/GraphFormat.h"
|
|
#include "Pregel/Iterators.h"
|
|
#include "Pregel/MasterContext.h"
|
|
#include "Pregel/Utils.h"
|
|
#include "Pregel/VertexComputation.h"
|
|
#include "Pregel/WorkerContext.h"
|
|
|
|
using namespace arangodb;
|
|
using namespace arangodb::pregel;
|
|
using namespace arangodb::pregel::algos;
|
|
|
|
static std::string const kMoreIterations = "more";
|
|
static const float RESTART_PROB = 0.15f;
|
|
static const float EPS = 0.0000001f;
|
|
|
|
LineRank::LineRank(arangodb::velocypack::Slice params)
|
|
: SimpleAlgorithm("LineRank", params) {
|
|
// VPackSlice t = params.get("convergenceThreshold");
|
|
//_threshold = t.isNumber() ? t.getNumber<float>() : 0.000002f;
|
|
}
|
|
|
|
struct LRWorkerContext : WorkerContext {
|
|
float startAtNodeProb = 0;
|
|
|
|
void preApplication() override { startAtNodeProb = 1.0f / edgeCount(); };
|
|
};
|
|
|
|
WorkerContext* LineRank::workerContext(VPackSlice params) const {
|
|
return new LRWorkerContext();
|
|
}
|
|
|
|
// github.com/JananiC/NetworkCentralities/blob/master/src/main/java/linerank/LineRank.java
|
|
struct LRComputation : public VertexComputation<float, float, float> {
|
|
LRComputation() {}
|
|
void compute(MessageIterator<float> const& messages) override {
|
|
LRWorkerContext const* ctx = static_cast<LRWorkerContext const*>(context());
|
|
|
|
float* vertexValue = mutableVertexData();
|
|
if (*vertexValue < 0.0f) {
|
|
*vertexValue = ctx->startAtNodeProb;
|
|
aggregate<bool>(kMoreIterations, true);
|
|
} else {
|
|
float newScore = 0.0f;
|
|
for (const float* msg : messages) {
|
|
newScore += *msg;
|
|
}
|
|
|
|
bool const* moreIterations = getAggregatedValue<bool>(kMoreIterations);
|
|
if (*moreIterations == false) {
|
|
*vertexValue = *vertexValue * getEdgeCount() + newScore;
|
|
voteHalt();
|
|
} else {
|
|
if (getEdgeCount() == 0) {
|
|
newScore = 0;
|
|
} else {
|
|
newScore /= getEdgeCount();
|
|
newScore = ctx->startAtNodeProb * RESTART_PROB +
|
|
newScore * (1.0f - RESTART_PROB);
|
|
}
|
|
|
|
float diff = fabsf(newScore - *vertexValue);
|
|
*vertexValue = newScore;
|
|
|
|
if (diff > EPS) {
|
|
aggregate(kMoreIterations, true);
|
|
}
|
|
}
|
|
}
|
|
sendMessageToAllNeighbours(*vertexValue);
|
|
}
|
|
};
|
|
|
|
VertexComputation<float, float, float>* LineRank::createComputation(
|
|
WorkerConfig const* config) const {
|
|
return new LRComputation();
|
|
}
|
|
|
|
IAggregator* LineRank::aggregator(std::string const& name) const {
|
|
if (name == kMoreIterations) {
|
|
return new BoolOrAggregator(false); // non perm
|
|
}
|
|
return nullptr;
|
|
}
|