mirror of https://gitee.com/bigwinds/arangodb
60 lines
2.3 KiB
C++
60 lines
2.3 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
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#ifndef ARANGODB_PREGEL_ALGOS_WCC_H
|
|
#define ARANGODB_PREGEL_ALGOS_WCC_H 1
|
|
|
|
#include "Pregel/Algorithm.h"
|
|
|
|
namespace arangodb {
|
|
namespace pregel {
|
|
namespace algos {
|
|
|
|
/// The idea behind the algorithm is very simple: propagate the smallest
|
|
/// vertex id along the edges to all vertices of a connected component. The
|
|
/// number of supersteps necessary is equal to the length of the maximum
|
|
/// diameter of all components + 1
|
|
/// doesn't necessarily leads to a correct result on unidirected graphs
|
|
struct ConnectedComponents : public SimpleAlgorithm<int64_t, int64_t, int64_t> {
|
|
public:
|
|
explicit ConnectedComponents(application_features::ApplicationServer& server, VPackSlice userParams)
|
|
: SimpleAlgorithm(server, "ConnectedComponents", userParams) {}
|
|
|
|
bool supportsAsyncMode() const override { return true; }
|
|
bool supportsCompensation() const override { return true; }
|
|
|
|
GraphFormat<int64_t, int64_t>* inputFormat() const override;
|
|
|
|
MessageFormat<int64_t>* messageFormat() const override {
|
|
return new IntegerMessageFormat();
|
|
}
|
|
MessageCombiner<int64_t>* messageCombiner() const override {
|
|
return new MinCombiner<int64_t>();
|
|
}
|
|
VertexComputation<int64_t, int64_t, int64_t>* createComputation(WorkerConfig const*) const override;
|
|
VertexCompensation<int64_t, int64_t, int64_t>* createCompensation(WorkerConfig const*) const override;
|
|
};
|
|
} // namespace algos
|
|
} // namespace pregel
|
|
} // namespace arangodb
|
|
#endif
|