breadthFirstSearch_driver.cpp File Reference

#include "drivers/breadthFirstSearch/breadthFirstSearch_driver.h"
#include <vector>
#include <algorithm>
#include <string>
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.h"
#include "breadthFirstSearch/pgr_breadthFirstSearch.hpp"

Include dependency graph for breadthFirstSearch_driver.cpp:

Go to the source code of this file.

Functions
void	do_pgr_breadthFirstSearch (pgr_edge_t *data_edges, size_t total_edges, int64_t *start_vidsArr, size_t size_start_vidsArr, int64_t max_depth, bool directed, pgr_mst_rt **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
template<class G >
std::vector< pgr_mst_rt >	pgr_breadthFirstSearch (G &graph, std::vector< int64_t > sources, int64_t max_depth)

Function Documentation

do_pgr_breadthFirstSearch()

void do_pgr_breadthFirstSearch	(	pgr_edge_t *	data_edges,
		size_t	total_edges,
		int64_t *	start_vidsArr,
		size_t	size_start_vidsArr,
		int64_t	max_depth,
		bool	directed,
		pgr_mst_rt **	return_tuples,
		size_t *	return_count,
		char **	log_msg,
		char **	notice_msg,
		char **	err_msg
	)

Definition at line 60 of file breadthFirstSearch_driver.cpp.

                                 {
    std::ostringstream log;
    std::ostringstream err;
    std::ostringstream notice;
    try {
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(!(*return_tuples));
        pgassert(*return_count == 0);
        pgassert(total_edges != 0);
 
        graphType gType = directed? DIRECTED: UNDIRECTED;
 
        log << "Inserting vertices into a c++ vector structure";
        std::vector<int64_t>
            start_vertices(start_vidsArr, start_vidsArr + size_start_vidsArr);
 
        std::vector<pgr_mst_rt> results;
        if (directed) {
            log << "Working with directed Graph\n";
            pgrouting::DirectedGraph digraph(gType);
            digraph.insert_edges(data_edges, total_edges);
            results = pgr_breadthFirstSearch(
                    digraph,
                    start_vertices,
                    max_depth);
 
        } else {
            log << "Working with Undirected Graph\n";
            pgrouting::UndirectedGraph undigraph(gType);
            undigraph.insert_edges(data_edges, total_edges);
 
            results = pgr_breadthFirstSearch(
                    undigraph,
                    start_vertices,
                    max_depth);
        }
 
        auto count = results.size();
 
        if (count == 0) {
            (*return_tuples) = NULL;
            (*return_count) = 0;
            notice <<
                "No traversal found";
            *log_msg = pgr_msg(notice.str().c_str());
            return;
        }
 
        (*return_tuples) = pgr_alloc(count, (*return_tuples));
        log << "\nConverting a set of traversals into the tuples";
        for (size_t i = 0; i < count; i++) {
            *((*return_tuples) + i) = results[i];
        }
        (*return_count) = count;
 
        pgassert(*err_msg == NULL);
        *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, pgrouting::graph::Pgr_base_graph< G, T_V, T_E >::insert_edges(), pgassert, pgr_alloc(), pgr_breadthFirstSearch(), pgr_free(), pgr_msg(), UNDIRECTED, and AssertFailedException::what().

Referenced by process().

pgr_breadthFirstSearch()

template<class G >

std::vector<pgr_mst_rt> pgr_breadthFirstSearch	(	G &	graph,
		std::vector< int64_t >	sources,
		int64_t	max_depth
	)

Definition at line 43 of file breadthFirstSearch_driver.cpp.

                           {
    std::sort(sources.begin(), sources.end());
    sources.erase(
            std::unique(sources.begin(), sources.end()),
            sources.end());
 
 
    pgrouting::functions::Pgr_breadthFirstSearch< G > fn_breadthFirstSearch;
    auto results = fn_breadthFirstSearch.breadthFirstSearch(
            graph, sources, max_depth);
    return results;
}

References pgrouting::functions::Pgr_breadthFirstSearch< G >::breadthFirstSearch().

Referenced by do_pgr_breadthFirstSearch().