one_to_many_dijkstra_driver.cpp

/*PGR-GNU*****************************************************************
File: one_to_many_dijkstra_driver.cpp

Generated with Template by:
Copyright (c) 2015 pgRouting developers
Mail: project@pgrouting.org

Function's developer: 
Copyright (c) 2015 Celia Virginia Vergara Castillo
Mail: vicky_vergara@hotmail.com

------

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*/

#ifdef __MINGW32__
#include <winsock2.h>
#include <windows.h>
#endif


#include <sstream>
#include <deque>
#include <vector>
#include "./pgr_dijkstra.hpp"
#include "./one_to_many_dijkstra_driver.h"

// #define DEBUG
#include "../../common/src/memory_func.hpp"
extern "C" {
#include "./../../common/src/pgr_types.h"
}

// CREATE OR REPLACE FUNCTION pgr_dijkstra(sql text, start_vid bigint, end_vids anyarray, directed boolean default true,
void
do_pgr_one_to_many_dijkstra(
        pgr_edge_t  *data_edges,
        size_t total_tuples,
        int64_t start_vid,
        int64_t  *end_vidsArr,
        size_t size_end_vidsArr,
        bool directed,
        bool only_cost,
        General_path_element_t **return_tuples,
        size_t *return_count,
        char ** err_msg) {
  std::ostringstream log;
  try {
    graphType gType = directed? DIRECTED: UNDIRECTED;
    const auto initial_size = total_tuples;

    std::deque< Path >paths;
    log << "Inserting vertices into a c++ vector structure\n";
    std::set< int64_t > s_end_vertices(end_vidsArr, end_vidsArr + size_end_vidsArr);
    std::vector< int64_t > end_vertices(s_end_vertices.begin(), s_end_vertices.end());


    if (directed) {
        log << "Working with directed Graph\n";
        Pgr_base_graph< DirectedGraph > digraph(gType, initial_size);
        digraph.graph_insert_data(data_edges, total_tuples);
        pgr_dijkstra(digraph, paths, start_vid, end_vertices, only_cost);
    } else {
        log << "Working with Undirected Graph\n";
        Pgr_base_graph< UndirectedGraph > undigraph(gType, initial_size);
        undigraph.graph_insert_data(data_edges, total_tuples);
        pgr_dijkstra(undigraph, paths, start_vid, end_vertices, only_cost);
    }

    size_t count(0);
    count = count_tuples(paths);


    if (count == 0) {
        (*return_tuples) = NULL;
        (*return_count) = 0;
        log <<
            "No paths found between Starting and any of the Ending vertices\n";
        *err_msg = strdup(log.str().c_str());
        return;
    }

    (*return_tuples) = get_memory(count, (*return_tuples));
    log << "Converting a set of paths into the tuples\n";
    (*return_count) = (collapse_paths(return_tuples, paths));

#ifndef DEBUG
    *err_msg = strdup("OK");
#else
    *err_msg = strdup(log.str().c_str());
#endif

    return;
  } catch ( ... ) {
      log << "Caught unknown expection!\n";
      *err_msg = strdup("Caught unknown expection!\n");
      return;
  }
}