detail Namespace Reference

Functions
template<class G >
std::deque< Path >	pgr_dijkstra (G &graph, std::vector< int64_t > sources, std::vector< int64_t > targets, bool only_cost, bool normal, size_t n_goals, bool global)
template<class G >
std::deque< Path >	pgr_dijkstra (G &graph, std::vector< pgr_combination_t > &combinations, bool only_cost, bool normal, size_t n_goals, bool global)
void	post_process (std::deque< Path > &paths, bool only_cost, bool normal, size_t n_goals, bool global)

Function Documentation

pgr_dijkstra() [1/2]

template<class G >

std::deque< Path > detail::pgr_dijkstra	(	G &	graph,
		std::vector< int64_t >	sources,
		std::vector< int64_t >	targets,
		bool	only_cost,
		bool	normal,
		size_t	n_goals,
		bool	global
	)

Definition at line 100 of file dijkstra_driver.cpp.

                     {
    std::sort(sources.begin(), sources.end());
    sources.erase(
            std::unique(sources.begin(), sources.end()),
            sources.end());
 
    std::sort(targets.begin(), targets.end());
    targets.erase(
            std::unique(targets.begin(), targets.end()),
            targets.end());
 
    pgrouting::Pgr_dijkstra< G > fn_dijkstra;
    auto paths = fn_dijkstra.dijkstra(
            graph,
            sources, targets,
            only_cost, n_goals);
 
    post_process(paths, only_cost, normal, n_goals, global);
 
    return paths;
}

References pgrouting::Pgr_dijkstra< G >::dijkstra(), and post_process().

Referenced by do_pgr_combinations_dijkstra(), and do_pgr_many_to_many_dijkstra().

pgr_dijkstra() [2/2]

template<class G >

std::deque< Path > detail::pgr_dijkstra	(	G &	graph,
		std::vector< pgr_combination_t > &	combinations,
		bool	only_cost,
		bool	normal,
		size_t	n_goals,
		bool	global
	)

Definition at line 132 of file dijkstra_driver.cpp.

                     {
    pgrouting::Pgr_dijkstra< G > fn_dijkstra;
    auto paths = fn_dijkstra.dijkstra(
            graph,
            combinations,
            only_cost, n_goals);
 
    post_process(paths, only_cost, normal, n_goals, global);
 
    return paths;
}

References pgrouting::Pgr_dijkstra< G >::dijkstra(), and post_process().

post_process()

void detail::post_process	(	std::deque< Path > &	paths,
		bool	only_cost,
		bool	normal,
		size_t	n_goals,
		bool	global
	)

Definition at line 51 of file dijkstra_driver.cpp.

                                                                                              {
    paths.erase(std::remove_if(paths.begin(), paths.end(),
                [](const Path &p) {
                    return p.size() == 0;
                }),
                paths.end());
    using difference_type = std::deque<double>::difference_type;
 
    if (!normal) {
        for (auto &path : paths) path.reverse();
    }
 
    if (!only_cost) {
        for (auto &p : paths) {
            p.recalculate_agg_cost();
        }
    }
 
    if (n_goals != (std::numeric_limits<size_t>::max)()) {
        std::sort(paths.begin(), paths.end(),
                [](const Path &e1, const Path &e2)->bool {
                    return e1.end_id() < e2.end_id();
                });
        std::stable_sort(paths.begin(), paths.end(),
                [](const Path &e1, const Path &e2)->bool {
                    return e1.start_id() < e2.start_id();
                });
        std::stable_sort(paths.begin(), paths.end(),
                [](const Path &e1, const Path &e2)->bool {
                    return e1.tot_cost() < e2.tot_cost();
                });
        if (global && n_goals < paths.size()) {
            paths.erase(paths.begin() + static_cast<difference_type>(n_goals), paths.end());
        }
    } else {
        std::sort(paths.begin(), paths.end(),
                [](const Path &e1, const Path &e2)->bool {
                    return e1.end_id() < e2.end_id();
                });
        std::stable_sort(paths.begin(), paths.end(),
                [](const Path &e1, const Path &e2)->bool {
                    return e1.start_id() < e2.start_id();
                });
    }
}

References Path::recalculate_agg_cost().

Referenced by pgr_dijkstra().