pgr_kruskal.hpp

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
File: pgr_kruskal.hpp
 
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
Copyright (c) 2018 Aditya Pratap Singh
[email protected]
 
------
 
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
 
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
 
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 
 ********************************************************************PGR-GNU*/
 
#ifndef INCLUDE_SPANNINGTREE_PGR_KRUSKAL_HPP_
#define INCLUDE_SPANNINGTREE_PGR_KRUSKAL_HPP_
#pragma once
 
#include <boost/graph/kruskal_min_spanning_tree.hpp>
#include <vector>
#include "spanningTree/pgr_mst.hpp"
#include "cpp_common/interruption.h"
 
namespace pgrouting {
namespace functions {
 
template <class G>
class Pgr_kruskal : public Pgr_mst<G> {
 public:
     std::vector<pgr_mst_rt> kruskal(G &graph);
 
     std::vector<pgr_mst_rt> kruskalBFS(
             G &graph,
             std::vector<int64_t> roots,
             int64_t max_depth);
 
     std::vector<pgr_mst_rt> kruskalDFS(
             G &graph,
             std::vector<int64_t> roots,
             int64_t max_depth);
 
     std::vector<pgr_mst_rt> kruskalDD(
             G &graph,
             std::vector<int64_t> roots,
             double distance);
 
 private:
     typedef typename G::B_G B_G;
     typedef typename G::V V;
     typedef typename G::E E;
 
     /* Does all the work */
     void generate_mst(const G &graph);
};
 
 
template <class G>
void
Pgr_kruskal<G>::generate_mst(const G &graph) {
    this->clear();
    /* abort in case of an interruption occurs (e.g. the query is being cancelled) */
    CHECK_FOR_INTERRUPTS();
    boost::kruskal_minimum_spanning_tree(
            graph.graph,
            std::inserter(this->m_spanning_tree.edges, this->m_spanning_tree.edges.begin()),
            boost::weight_map(get(&G::G_T_E::cost, graph.graph)));
}
 
 
template <class G>
std::vector<pgr_mst_rt>
Pgr_kruskal<G>::kruskal(
        G &graph) {
    return this->mst(graph);
}
 
 
template <class G>
std::vector<pgr_mst_rt>
Pgr_kruskal<G>::kruskalBFS(
        G &graph,
        std::vector<int64_t> roots,
        int64_t max_depth) {
    return this->mstBFS(graph, roots, max_depth);
}
 
template <class G>
std::vector<pgr_mst_rt>
Pgr_kruskal<G>::kruskalDFS(
        G &graph,
        std::vector<int64_t> roots,
        int64_t max_depth) {
    return this->mstDFS(graph, roots, max_depth);
}
 
template <class G>
std::vector<pgr_mst_rt>
Pgr_kruskal<G>::kruskalDD(
        G &graph,
        std::vector<int64_t> roots,
        double distance) {
    return this->mstDD(graph, roots, distance);
}
 
 
}  // namespace functions
}  // namespace pgrouting
 
#endif  // INCLUDE_SPANNINGTREE_PGR_KRUSKAL_HPP_