|
PGROUTING
3.2
|
Go to the documentation of this file.
26 #ifndef INCLUDE_C_TYPES_COLUMN_INFO_T_H_
27 #define INCLUDE_C_TYPES_COLUMN_INFO_T_H_
59 #endif // INCLUDE_C_TYPES_COLUMN_INFO_T_H_
std::vector< pgr_components_rt > biconnectedComponents(pgrouting::UndirectedGraph &graph)
Biconnected Components.
T * pgr_alloc(std::size_t size, T *ptr)
allocates memory
void check_parameters(int heuristic, double factor, double epsilon)
option(BUILD_DOXY "Set ON|OFF (default=OFF) to build Developers Documentation" ON) if(BUILD_DOXY AND WITH_DOC) message(STATUS "Developers documentation.") find_package(Doxygen $
Identifiers< int64_t > articulationPoints(pgrouting::UndirectedGraph &graph)
Articulation Points.
Identifiers< int64_t > bridges(pgrouting::UndirectedGraph &graph)
Bridges Bridges are closely related to the concept of articulation vertices, vertices that belong to ...
void get_new_queries(char *edges_sql, char *points_sql, char **edges_of_points_query, char **edges_no_points_query)
std::vector< pgr_components_rt > componentsResult(std::vector< std::vector< int64_t > > &components)
void time_msg(char *msg, clock_t start_t, clock_t end_t)
PGDLLEXPORT Datum randomSpanningTree(PG_FUNCTION_ARGS)
ADD_LIBRARY(version OBJECT version.c _version.c) configure_file(_version.h.in $
std::vector< pgr_components_rt > strongComponents(pgrouting::DirectedGraph &graph)
Strongly Connected Components Vertex Version.