minCostMaxFlow_driver.cpp File Reference

#include "drivers/max_flow/minCostMaxFlow_driver.h"
#include <sstream>
#include <deque>
#include <vector>
#include <set>
#include "max_flow/pgr_minCostMaxFlow.hpp"
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.h"

Include dependency graph for minCostMaxFlow_driver.cpp:

Go to the source code of this file.

Functions
void	do_pgr_minCostMaxFlow (pgr_costFlow_t *data_edges, size_t total_edges, pgr_combination_t *combinations, size_t total_combinations, int64_t *sourceVertices, size_t sizeSourceVerticesArr, int64_t *sinkVertices, size_t sizeSinkVerticesArr, bool only_cost, pgr_flow_t **return_tuples, size_t *return_count, char **log_msg, char **notice_msg, char **err_msg)

Function Documentation

do_pgr_minCostMaxFlow()

void do_pgr_minCostMaxFlow	(	pgr_costFlow_t *	data_edges,
		size_t	total_edges,
		pgr_combination_t *	combinations,
		size_t	total_combinations,
		int64_t *	sourceVertices,
		size_t	sizeSourceVerticesArr,
		int64_t *	sinkVertices,
		size_t	sizeSinkVerticesArr,
		bool	only_cost,
		pgr_flow_t **	return_tuples,
		size_t *	return_count,
		char **	log_msg,
		char **	notice_msg,
		char **	err_msg
	)

Definition at line 43 of file minCostMaxFlow_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(data_edges);
        pgassert(total_edges != 0);
        pgassert((sourceVertices && sinkVertices) || combinations);
        pgassert((sizeSourceVerticesArr && sizeSinkVerticesArr) || total_combinations);
 
        std::vector<pgr_costFlow_t> edges(data_edges, data_edges + total_edges);
        std::set<int64_t> sources(
                sourceVertices, sourceVertices + sizeSourceVerticesArr);
        std::set<int64_t> targets(
                sinkVertices, sinkVertices + sizeSinkVerticesArr);
        std::vector< pgr_combination_t > combinations_vector(
                combinations, combinations + total_combinations);
 
        if (!combinations_vector.empty()) {
            pgassert(sources.empty());
            pgassert(targets.empty());
 
            for (const pgr_combination_t &comb : combinations_vector) {
                sources.insert(comb.source);
                targets.insert(comb.target);
            }
        }
 
        std::set<int64_t> vertices(sources);
        vertices.insert(targets.begin(), targets.end());
 
        if (vertices.size()
                != (sources.size() + targets.size())) {
            *err_msg = pgr_msg("A source found as sink");
            return;
        }
 
        pgrouting::graph::PgrCostFlowGraph digraph(
                edges, sources, targets);
 
        double min_cost;
        min_cost = digraph.MinCostMaxFlow();
 
        std::vector<pgr_flow_t> flow_edges;
 
        if (only_cost) {
            pgr_flow_t edge;
            edge.edge = -1;
            edge.source = -1;
            edge.target = -1;
            edge.flow = -1;
            edge.residual_capacity = -1;
            edge.cost = min_cost;
            edge.agg_cost = min_cost;
            flow_edges.push_back(edge);
        } else {
            flow_edges = digraph.GetFlowEdges();
        }
 
        (*return_tuples) = pgr_alloc(flow_edges.size(), (*return_tuples));
        for (size_t i = 0; i < flow_edges.size(); i++) {
            (*return_tuples)[i] = flow_edges[i];
        }
        *return_count = flow_edges.size();
 
        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 edge::cost, pgrouting::graph::PgrCostFlowGraph::GetFlowEdges(), pgrouting::graph::PgrCostFlowGraph::MinCostMaxFlow(), pgassert, pgr_alloc(), pgr_free(), pgr_msg(), edge::source, edge::target, and AssertFailedException::what().

Referenced by process().