transitiveClosure_driver.cpp File Reference

#include "drivers/transitiveClosure/transitiveClosure_driver.h"
#include <string.h>
#include <sstream>
#include <deque>
#include <vector>
#include <algorithm>
#include "transitiveClosure/pgr_transitiveClosure.hpp"
#include "cpp_common/identifiers.hpp"
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/basePath_SSEC.hpp"
#include "cpp_common/pgr_base_graph.hpp"

Include dependency graph for transitiveClosure_driver.cpp:

Go to the source code of this file.

Functions
void	do_pgr_transitiveClosure (pgr_edge_t *data_edges, size_t total_edges, transitiveClosure_rt **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
template<typename G >
static void	get_postgres_result (G &graph, transitiveClosure_rt **return_tuples, size_t *count)
template<class G >
static boost::adjacency_list	pgr_transitiveClosure (G &graph)

Function Documentation

do_pgr_transitiveClosure()

void do_pgr_transitiveClosure	(	pgr_edge_t *	data_edges,
		size_t	total_edges,
		transitiveClosure_rt **	return_tuples,
		size_t *	return_count,
		char **	log_msg,
		char **	notice_msg,
		char **	err_msg
	)

Definition at line 94 of file transitiveClosure_driver.cpp.

                        {
    std::ostringstream log;
    std::ostringstream notice;
    std::ostringstream err;
    try {
        pgassert(total_edges != 0);
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(!(*return_tuples));
        pgassert(*return_count == 0);
 
        /*
         * Converting to C++ structures
         */
        std::vector<pgr_edge_t> edges(data_edges, data_edges + total_edges);
 
 
        graphType gType = DIRECTED;
        pgrouting::DirectedGraph digraph(gType);
        digraph.insert_edges(data_edges, total_edges);
 
        get_postgres_result(
                digraph,
                return_tuples,
                return_count);
 
        *log_msg = log.str().empty()?
            *log_msg :
            pgr_msg(log.str().c_str());
        *notice_msg = notice.str().empty()?
            *notice_msg :
            pgr_msg(notice.str().c_str());
    } catch (AssertFailedException &except) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    } catch (std::exception &except) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << except.what();
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    } catch(...) {
        (*return_tuples) = pgr_free(*return_tuples);
        (*return_count) = 0;
        err << "Caught unknown exception!";
        *err_msg = pgr_msg(err.str().c_str());
        *log_msg = pgr_msg(log.str().c_str());
    }
}

References DIRECTED, get_postgres_result(), pgrouting::graph::Pgr_base_graph< G, T_V, T_E >::insert_edges(), pgassert, pgr_free(), pgr_msg(), and AssertFailedException::what().

Referenced by process().

get_postgres_result()

template<typename G >

static void get_postgres_result ( G &  graph, transitiveClosure_rt **  return_tuples, size_t *  count  )

static

Definition at line 52 of file transitiveClosure_driver.cpp.

                       {
    boost::adjacency_list <> TC;
    TC = pgr_transitiveClosure(graph);
    (*count) = boost::num_vertices(TC);
    (*return_tuples) = pgr_alloc((*count), (*return_tuples));
    size_t sequence = 0;
    boost::graph_traits < boost::adjacency_list <> >::vertex_iterator i, end;
    boost::graph_traits < boost::adjacency_list <> >::adjacency_iterator ai, a_end;
    int ii = 1;
    for (boost::tie(i, end) = boost::vertices(TC); i != end; ++i) {
            auto u = *i;
            int64_t* target_array = nullptr;
            auto uid = graph.graph[u].id;
            boost::tie(ai, a_end) = adjacent_vertices(u, TC);
            size_t adj_siz = static_cast<size_t>(a_end - ai);
            target_array = pgr_alloc(adj_siz , target_array);
            int number = 0;
            for (; ai != a_end; ++ai) {
                auto v = *ai;
                int64_t vid = graph.graph[v].id;
                target_array[number++] = vid;
            }
 
        (*return_tuples)[sequence] = {
            ii++,
            uid,
            target_array,
            number};
 
         ++sequence;
    }
}

References pgr_alloc(), and pgr_transitiveClosure().

Referenced by do_pgr_transitiveClosure().

pgr_transitiveClosure()

template<class G >

static boost::adjacency_list pgr_transitiveClosure ( G &  graph )

static

Definition at line 43 of file transitiveClosure_driver.cpp.

                  {
    Pgr_transitiveClosure< G > fn_transitiveClosure;
    return fn_transitiveClosure.transitiveClosure(graph);
}

References Pgr_transitiveClosure< G >::transitiveClosure().

Referenced by get_postgres_result().