edge_disjoint_paths_driver.cpp File Reference

#include "drivers/max_flow/edge_disjoint_paths_driver.h"
#include <sstream>
#include <vector>
#include <set>
#include "max_flow/pgr_maxflow.hpp"
#include "cpp_common/identifiers.hpp"
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.h"

Include dependency graph for edge_disjoint_paths_driver.cpp:

Go to the source code of this file.

Functions
void	do_pgr_edge_disjoint_paths (pgr_edge_t *data_edges, size_t total_edges, pgr_combination_t *combinations, size_t total_combinations, int64_t *sources, size_t size_source_verticesArr, int64_t *sinks, size_t size_sink_verticesArr, bool directed, General_path_element_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)
static std::vector< General_path_element_t >	single_execution (std::vector< pgr_edge_t > edges, int64_t source, int64_t target, bool directed)

Function Documentation

do_pgr_edge_disjoint_paths()

void do_pgr_edge_disjoint_paths	(	pgr_edge_t *	data_edges,
		size_t	total_edges,
		pgr_combination_t *	combinations,
		size_t	total_combinations,
		int64_t *	sources,
		size_t	size_source_verticesArr,
		int64_t *	sinks,
		size_t	size_sink_verticesArr,
		bool	directed,
		General_path_element_t **	return_tuples,
		size_t *	return_count,
		char **	log_msg,
		char **	notice_msg,
		char **	err_msg
	)

Definition at line 66 of file edge_disjoint_paths_driver.cpp.

                    {
    std::ostringstream log;
    std::ostringstream notice;
    std::ostringstream err;
    try {
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(!(*return_tuples));
        pgassert(*return_count == 0);
        pgassert(data_edges);
        pgassert(total_edges != 0);
        pgassert((sources && sinks) || combinations);
        pgassert((size_source_verticesArr && size_sink_verticesArr) || total_combinations);
 
        std::set<int64_t> set_source_vertices(
                sources, sources + size_source_verticesArr);
        std::set<int64_t> set_sink_vertices(
                sinks, sinks + size_sink_verticesArr);
        std::vector< pgr_combination_t > combinations_vector(
                combinations, combinations + total_combinations);
        std::vector<pgr_edge_t> edges(
                data_edges, data_edges + total_edges);
 
        if (!combinations_vector.empty()) {
            pgassert(set_source_vertices.empty());
            pgassert(set_sink_vertices.empty());
 
            for (const pgr_combination_t &comb : combinations_vector) {
                set_source_vertices.insert(comb.source);
                set_sink_vertices.insert(comb.target);
            }
        }
 
 
        std::vector<General_path_element_t> paths;
        for (const auto &s : set_source_vertices) {
            for (const auto &t : set_sink_vertices) {
                auto path = single_execution(
                        edges,
                        s,
                        t,
                        directed);
                paths.insert(paths.end(), path.begin(), path.end());
            }
        }
 
        if (paths.empty()) {
            *return_tuples = nullptr;
            *return_count = 0;
            return;
        }
 
        /*
         * Initializing the cost
         */
        for (auto &r : paths) {
            r.agg_cost = r.cost = 0;
        }
 
        /*
         * Calculating the cost
         */
        auto found = paths.size();
        for (const auto &e : edges) {
            for (auto &r : paths) {
                if (r.edge == e.id) {
                    r.cost = (r.node == e.source) ?
                        e.cost : e.reverse_cost;
                    --found;
                }
            }
            if (found == 0) break;
        }
 
        /*
         * Calculating the agg_cost
         */
        auto prev = paths[0];
        for (auto &r : paths) {
            if (r.seq == 1) {
                r.agg_cost = 0;
            } else {
                r.agg_cost = prev.agg_cost + prev.cost;
            }
            prev = r;
        }
 
        /*
         * Numbering the paths
         */
        int path_id(0);
        for (auto &r : paths) {
            r.start_id = path_id;
            if (r.edge == -1) ++path_id;
        }
 
 
        (*return_tuples) = pgr_alloc(paths.size(), (*return_tuples));
        for (size_t i = 0; i < paths.size(); ++i) {
            (*return_tuples)[i] = paths[i];
        }
        *return_count = paths.size();
 
 
        *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 General_path_element_t::agg_cost, pgassert, pgr_alloc(), pgr_free(), pgr_msg(), single_execution(), and AssertFailedException::what().

Referenced by process().

single_execution()

static std::vector<General_path_element_t> single_execution ( std::vector< pgr_edge_t >  edges, int64_t  source, int64_t  target, bool  directed  )

static

Definition at line 45 of file edge_disjoint_paths_driver.cpp.

                       {
    std::set<int64_t> set_source_vertices;
    std::set<int64_t> set_sink_vertices;
    set_source_vertices.insert(source);
    set_sink_vertices.insert(target);
    pgrouting::graph::PgrFlowGraph G(
            edges,
            set_source_vertices,
            set_sink_vertices, directed);
 
    /*
     * boykov_kolmogorov is only for directed graphs
     */
    return G.edge_disjoint_paths();
}

Referenced by do_pgr_edge_disjoint_paths().