PGROUTING  3.2
pgr_components.cpp File Reference
#include "components/pgr_components.hpp"
#include <boost/config.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/strong_components.hpp>
#include <boost/graph/biconnected_components.hpp>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include "cpp_common/identifiers.hpp"
#include "cpp_common/interruption.h"
Include dependency graph for pgr_components.cpp:

Go to the source code of this file.

Namespaces

 pgrouting
 Book keeping class for swapping orders between vehicles.
 
 pgrouting::algorithms
 

Functions

Identifiers< int64_t > pgrouting::algorithms::articulationPoints (pgrouting::UndirectedGraph &graph)
 Articulation Points. More...
 
std::vector< pgr_components_rtpgrouting::algorithms::biconnectedComponents (pgrouting::UndirectedGraph &graph)
 Biconnected Components. More...
 
Identifiers< int64_t > pgrouting::algorithms::bridges (pgrouting::UndirectedGraph &graph)
 Bridges Bridges are closely related to the concept of articulation vertices, vertices that belong to every path between some pair of other vertices. More...
 
std::vector< pgr_components_rtpgrouting::algorithms::pgr_connectedComponents (pgrouting::UndirectedGraph &graph)
 works for undirected graph More...
 
std::vector< pgr_components_rtpgrouting::algorithms::strongComponents (pgrouting::DirectedGraph &graph)
 Strongly Connected Components Vertex Version. More...