topologicalSort_driver.cpp

Go to the documentation of this file.

/*PGR-GNU*****************************************************************
File: topologicalSort_driver.cpp
 
Generated with Template by:
Copyright (c) 2015 pgRouting developers
Mail: [email protected]
 
Function's developer:
Copyright (c) 2019 Hang Wu
mail: [email protected]
 
------
 
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*/
 
#include "drivers/topologicalSort/topologicalSort_driver.h"
 
#include <sstream>
#include <deque>
#include <vector>
#include <algorithm>
#include <limits>
 
#include "topologicalSort/pgr_topologicalSort.hpp"
 
 
#include "cpp_common/pgr_alloc.hpp"
#include "cpp_common/pgr_assert.h"
 
template < class G >
static
std::vector<pgr_topologicalSort_t>
pgr_topologicalSort(
        G &graph) {
    Pgr_topologicalSort< G > fn_topologicalSort;
    return fn_topologicalSort.topologicalSort(graph);
}
 
 
// CREATE OR REPLACE FUNCTION pgr_topologicalSort(
// sql text,
void
do_pgr_topologicalSort(
        pgr_edge_t  *data_edges,
        size_t total_edges,
 
 
        pgr_topologicalSort_t **return_tuples,
        size_t *return_count,
        char ** log_msg,
        char ** notice_msg,
        char ** err_msg) {
    std::ostringstream log;
    std::ostringstream err;
    std::ostringstream notice;
 
    try {
        pgassert(total_edges != 0);
        pgassert(!(*log_msg));
        pgassert(!(*notice_msg));
        pgassert(!(*err_msg));
        pgassert(!(*return_tuples));
        pgassert(*return_count == 0);
 
        graphType gType =  DIRECTED;
 
        std::vector<pgr_topologicalSort_t> results;
 
        log << "Working with Directed Graph\n";
        pgrouting::DirectedGraph digraph(gType);
        digraph.insert_edges(data_edges, total_edges);
        results = pgr_topologicalSort(
                digraph);
 
        auto count = results.size();
 
        if (count == 0) {
            (*return_tuples) = NULL;
            (*return_count) = 0;
            notice <<
                "No vertices";
            return;
        }
 
        (*return_tuples) = pgr_alloc(count, (*return_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());
    }
}