PGROUTING
3.2
|
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/property_map/property_map.hpp>
#include <boost/graph/johnson_all_pairs_shortest.hpp>
#include <boost/graph/floyd_warshall_shortest.hpp>
#include <deque>
#include <vector>
#include <set>
#include <limits>
#include "cpp_common/basePath_SSEC.hpp"
#include "cpp_common/pgr_base_graph.hpp"
#include "cpp_common/interruption.h"
#include "cpp_common/pgr_alloc.hpp"
Go to the source code of this file.
Classes | |
class | Pgr_allpairs< G > |
class | Pgr_allpairs< G > |
struct | Pgr_allpairs< G >::inf_plus< T > |
Functions | |
template<class G > | |
void | pgr_floydWarshall (G &graph, size_t &result_tuple_count, Matrix_cell_t **postgres_rows) |
template<class G > | |
void | pgr_floydWarshall (G &graph, std::vector< Matrix_cell_t > &rows) |
template<class G > | |
void | pgr_johnson (G &graph, size_t &result_tuple_count, Matrix_cell_t **postgres_rows) |
template<class G > | |
void | pgr_johnson (G &graph, std::vector< Matrix_cell_t > &rows) |
void pgr_floydWarshall | ( | G & | graph, |
size_t & | result_tuple_count, | ||
Matrix_cell_t ** | postgres_rows | ||
) |
void pgr_floydWarshall | ( | G & | graph, |
std::vector< Matrix_cell_t > & | rows | ||
) |
Definition at line 64 of file pgr_allpairs.hpp.
References Pgr_allpairs< G >::floydWarshall().
Referenced by do_pgr_floydWarshall().
void pgr_johnson | ( | G & | graph, |
size_t & | result_tuple_count, | ||
Matrix_cell_t ** | postgres_rows | ||
) |
void pgr_johnson | ( | G & | graph, |
std::vector< Matrix_cell_t > & | rows | ||
) |
Definition at line 57 of file pgr_allpairs.hpp.
References Pgr_allpairs< G >::johnson().
Referenced by do_pgr_johnson().