//////////////////////////////////////////////////////////////////////////////// /// 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_ShoPath_H #define ARANGODB_PREGEL_ALGOS_ShoPath_H 1 #include "Pregel/Algorithm.h" namespace arangodb { namespace pregel { namespace algos { struct SPGraphFormat; /// Single Source Shortest Path. Uses integer attribute 'value', the source /// should have /// the value == 0, all others -1 or an undefined value struct ShortestPathAlgorithm : public Algorithm { std::string _source, _target; public: explicit ShortestPathAlgorithm(application_features::ApplicationServer& server, VPackSlice userParams); bool supportsAsyncMode() const override { return true; } bool supportsLazyLoading() const override { return true; } GraphFormat* inputFormat() const override; MessageFormat* messageFormat() const override { return new IntegerMessageFormat(); } MessageCombiner* messageCombiner() const override { return new MinCombiner(); } VertexComputation* createComputation(WorkerConfig const* config) const override; IAggregator* aggregator(std::string const& name) const override; std::set initialActiveSet() override; }; } // namespace algos } // namespace pregel } // namespace arangodb #endif