PGROUTING  3.2
Public Types | Public Member Functions | Friends | List of all members
pgrouting::graph::Pgr_contractionGraph< G > Class Template Reference

#include "pgr_contractionGraph.hpp"

Inheritance diagram for pgrouting::graph::Pgr_contractionGraph< G >:
Inheritance graph
[legend]
Collaboration diagram for pgrouting::graph::Pgr_contractionGraph< G >:
Collaboration graph
[legend]

Public Types

typedef boost::graph_traits< G >::edge_descriptor E
 
typedef boost::graph_traits< G >::in_edge_iterator EI_i
 
typedef boost::graph_traits< G >::out_edge_iterator EO_i
 
typedef boost::graph_traits< G >::vertex_descriptor V
 
Id handling related types
Type Meaning pgRouting Meaning
id_to_V maps id -> V given an id store the V
LI Left Iterator iterates over id_to_V
typedef std::map< int64_t, V > id_to_V
 
typedef id_to_V::const_iterator LI
 
Graph related types
Type boost meaning pgRouting meaning
G boost::adjacency_list Graph
V vertex_descriptor Think of it as local ID of a vertex
E edge_descriptor Think of it as local ID of an edge
V_i vertex_iterator To cycle the vertices of the Graph
E_i edge_iterator To cycle the edges of the Graph
EO_i out_edge_iterator To cycle the out going edges of a vertex
EI_i in_edge_iterator To cycle the in coming edges of a vertex (only in bidirectional graphs)
typedef G B_G
 
typedef CH_edge G_T_E
 
typedef CH_vertex G_T_V
 
typedef boost::graph_traits< G >::vertex_iterator V_i
 
typedef boost::graph_traits< G >::edge_iterator E_i
 
typedef boost::graph_traits< G >::vertices_size_type vertices_size_type
 
typedef boost::graph_traits< G >::edges_size_type edges_size_type
 
typedef boost::graph_traits< G >::degree_size_type degree_size_type
 
Id handling related types
Type Meaning pgRouting Meaning
id_to_V maps id -> V given an id store the V
LI Left Iterator iterates over id_to_V
typedef std::map< int64_t, V > id_to_V
 
typedef id_to_V::const_iterator LI
 

Public Member Functions

 Pgr_contractionGraph (graphType gtype)
 Prepares the graph to be of type gtype More...
 
void add_shortcut (const CH_edge &edge, V u, V v)
 add_shortuct to the graph during contraction More...
 
Identifiers< V > find_adjacent_vertices (V v) const
 get the vertex descriptors of adjacent vertices of v More...
 
std::tuple< double, Identifiers< int64_t >, bool > get_min_cost_edge (V u, V v)
 get the edge with minimum cost between two vertices More...
 
bool has_u_v_w (V u, V v, V w) const
 
bool is_linear (V v)
 
bool is_shortcut_possible (V u, V v, V w)
 Possibility of a shortcut from left vertex to right vertex v* should be a linear vertex u <-> v -> w: v not considered linear. More...
 
boost wrappers with original id
degree_size_type out_degree (int64_t vertex_id) const
 get the out-degree of a vertex More...
 
degree_size_type in_degree (int64_t vertex_id) const
 
V get_V (const CH_vertex &vertex)
 get the vertex descriptor of the vertex When the vertex does not exist More...
 
V get_V (int64_t vid) const
 get the vertex descriptor of the vid Call has_vertex(vid) before calling this function More...
 
bool has_vertex (int64_t vid) const
 True when vid is in the graph. More...
 
boost wrappers with V
degree_size_type out_degree (V &v) const
 out degree of a vertex More...
 
degree_size_type in_degree (V &v) const
 in degree of a vertex More...
 
CH_edge & operator[] (E e_idx)
 
const CH_edge & operator[] (E e_idx) const
 
CH_vertex & operator[] (V v_idx)
 
const CH_vertex & operator[] (V v_idx) const
 
V source (E e_idx) const
 
V target (E e_idx) const
 
V adjacent (V v_idx, E e_idx) const
 
to be or not to be
bool is_directed () const
 
bool is_undirected () const
 
bool is_source (V v_idx, E e_idx) const
 
bool is_target (V v_idx, E e_idx) const
 
edge disconection/reconnection
void disconnect_edge (int64_t p_from, int64_t p_to)
 Disconnects all edges from p_from to p_to. More...
 
void disconnect_out_going_edge (int64_t vertex_id, int64_t edge_id)
 Disconnects the outgoing edges of a vertex. More...
 
void disconnect_vertex (int64_t p_vertex)
 Disconnects all incoming and outgoing edges from the vertex. More...
 
void disconnect_vertex (V vertex)
 
void restore_graph ()
 Reconnects all edges that were removed. More...
 
boost wrappers with original id
degree_size_type out_degree (int64_t vertex_id) const
 get the out-degree of a vertex More...
 
degree_size_type in_degree (int64_t vertex_id) const
 
V get_V (const CH_vertex &vertex)
 get the vertex descriptor of the vertex When the vertex does not exist More...
 
V get_V (int64_t vid) const
 get the vertex descriptor of the vid Call has_vertex(vid) before calling this function More...
 
bool has_vertex (int64_t vid) const
 True when vid is in the graph. More...
 
boost wrappers with V
degree_size_type out_degree (V &v) const
 out degree of a vertex More...
 
degree_size_type in_degree (V &v) const
 in degree of a vertex More...
 
CH_edge & operator[] (E e_idx)
 
const CH_edge & operator[] (E e_idx) const
 
CH_vertex & operator[] (V v_idx)
 
const CH_vertex & operator[] (V v_idx) const
 
V source (E e_idx) const
 
V target (E e_idx) const
 
V adjacent (V v_idx, E e_idx) const
 
to be or not to be
bool is_directed () const
 
bool is_undirected () const
 
bool is_source (V v_idx, E e_idx) const
 
bool is_target (V v_idx, E e_idx) const
 
edge disconection/reconnection
void disconnect_edge (int64_t p_from, int64_t p_to)
 Disconnects all edges from p_from to p_to. More...
 
void disconnect_out_going_edge (int64_t vertex_id, int64_t edge_id)
 Disconnects the outgoing edges of a vertex. More...
 
void disconnect_vertex (int64_t p_vertex)
 Disconnects all incoming and outgoing edges from the vertex. More...
 
void disconnect_vertex (V vertex)
 
void restore_graph ()
 Reconnects all edges that were removed. More...
 
only for stand by program
int64_t get_edge_id (V from, V to, double &distance) const
 
E get_edge (V from, V to, double &distance) const
 
size_t num_vertices () const
 
size_t num_edges () const
 
void graph_add_edge (const CH_edge &edge)
 
void graph_add_edge (const T &edge, bool normal=true)
 
void graph_add_min_edge_no_parallel (const T &edge)
 
void graph_add_neg_edge (const T &edge, bool normal=true)
 
void graph_add_edge_no_create_vertex (const T &edge)
 Use this function when the vertices are already inserted in the graph. More...
 

Public Attributes

Graph Modification
std::deque< CH_edge > removed_edges
 Used for storing the removed_edges. More...
 
The Graph
G graph
 The graph. More...
 
graphType m_gType
 type (DIRECTED or UNDIRECTED) More...
 
Graph Modification
std::deque< CH_edge > removed_edges
 Used for storing the removed_edges. More...
 

Friends

std::ostream & operator<< (std::ostream &os, const Pgr_contractionGraph &g)
 print the graph with contracted vertices of all vertices and edges More...
 

Id mapping handling

typedef std::map< V, size_t > IndexMap
 
id_to_V vertices_map
 id -> graph id More...
 
boost::property_map< G, boost::vertex_index_t >::type vertIndex
 
IndexMap mapIndex
 
boost::associative_property_map< IndexMap > propmapIndex
 

Insert edges

void insert_edges (const T *edges, size_t count)
 Inserts count edges of type T into the graph. More...
 
void insert_edges (T *edges, size_t count, bool)
 
void insert_edges (const std::vector< T > &edges, bool normal=true)
 Inserts count edges of type pgr_edge_t into the graph The set of edges should not have an illegal vertex defined When the graph is empty calls: More...
 
void insert_edges_neg (const T *edges, size_t count)
 
void insert_negative_edges (const T *edges, int64_t count)
 
void insert_negative_edges (const std::vector< T > &edges, bool normal=true)
 
void insert_min_edges_no_parallel (const T *edges, size_t count)
 
void insert_min_edges_no_parallel (const std::vector< T > &edges)
 
void add_vertices (std::vector< CH_vertex > vertices)
 adds the vertices into the graph More...
 

Detailed Description

template<class G>
class pgrouting::graph::Pgr_contractionGraph< G >

Definition at line 51 of file pgr_contractionGraph.hpp.

Member Typedef Documentation

◆ B_G

typedef G pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::B_G
inherited

Definition at line 226 of file pgr_base_graph.hpp.

◆ degree_size_type

typedef boost::graph_traits< G >::degree_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::degree_size_type
inherited

Definition at line 241 of file pgr_base_graph.hpp.

◆ E

template<class G >
typedef boost::graph_traits< G >::edge_descriptor pgrouting::graph::Pgr_contractionGraph< G >::E

Definition at line 54 of file pgr_contractionGraph.hpp.

◆ E_i

typedef boost::graph_traits< G >::edge_iterator pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::E_i
inherited

Definition at line 232 of file pgr_base_graph.hpp.

◆ edges_size_type

typedef boost::graph_traits< G >::edges_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::edges_size_type
inherited

Definition at line 239 of file pgr_base_graph.hpp.

◆ EI_i

template<class G >
typedef boost::graph_traits< G >::in_edge_iterator pgrouting::graph::Pgr_contractionGraph< G >::EI_i

Definition at line 56 of file pgr_contractionGraph.hpp.

◆ EO_i

template<class G >
typedef boost::graph_traits< G >::out_edge_iterator pgrouting::graph::Pgr_contractionGraph< G >::EO_i

Definition at line 55 of file pgr_contractionGraph.hpp.

◆ G_T_E

typedef CH_edge pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::G_T_E
inherited

Definition at line 227 of file pgr_base_graph.hpp.

◆ G_T_V

typedef CH_vertex pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::G_T_V
inherited

Definition at line 228 of file pgr_base_graph.hpp.

◆ id_to_V

typedef std::map< int64_t, V > pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::id_to_V
inherited

Definition at line 253 of file pgr_base_graph.hpp.

◆ IndexMap

typedef std::map<V, size_t> pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::IndexMap
inherited

Definition at line 271 of file pgr_base_graph.hpp.

◆ LI

typedef id_to_V::const_iterator pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::LI
inherited

Definition at line 254 of file pgr_base_graph.hpp.

◆ V

template<class G >
typedef boost::graph_traits< G >::vertex_descriptor pgrouting::graph::Pgr_contractionGraph< G >::V

Definition at line 53 of file pgr_contractionGraph.hpp.

◆ V_i

typedef boost::graph_traits< G >::vertex_iterator pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::V_i
inherited

Definition at line 231 of file pgr_base_graph.hpp.

◆ vertices_size_type

typedef boost::graph_traits< G >::vertices_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::vertices_size_type
inherited

Definition at line 237 of file pgr_base_graph.hpp.

Constructor & Destructor Documentation

◆ Pgr_contractionGraph()

template<class G >
pgrouting::graph::Pgr_contractionGraph< G >::Pgr_contractionGraph ( graphType  gtype)
inlineexplicit

Prepares the graph to be of type gtype

Definition at line 61 of file pgr_contractionGraph.hpp.

62  : Pgr_base_graph<G, CH_vertex, CH_edge >(gtype) {
63  }

Member Function Documentation

◆ add_shortcut()

template<class G >
void pgrouting::graph::Pgr_contractionGraph< G >::add_shortcut ( const CH_edge &  edge,
V  u,
V  v 
)
inline

add_shortuct to the graph during contraction

u -> v -> w

u -> w

edge (u, w) is a new edge e e.contracted_vertices = v + v.contracted vertices

removed from graph edges: u -> v and v -> w

Parameters
[in]edgeof type CH_edge is to be added

Definition at line 170 of file pgr_contractionGraph.hpp.

170  {
171  bool inserted;
172  E e;
173  if (edge.cost < 0) return;
174 
175  boost::tie(e, inserted) = boost::add_edge(u, v, this->graph);
176 
177  this->graph[e]= edge;
178  }

References edge::cost, and pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph.

◆ add_vertices()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::add_vertices ( std::vector< CH_vertex >  vertices)
inlineprivateinherited

adds the vertices into the graph

PRECONDITIONS:

  • The graph has not being initialized before
  • There are no dupicated vertices
precondition(boost::num_vertices(graph) == 0);
for (vertex : vertices)
precondition(!has_vertex(vertex.id));

POSTCONDITIONS:

postcondition(boost::num_vertices(graph) == vertices.size());
for (vertex : vertices)
postcondition(has_vertex(vertex.id));

Example use:

pgrouting::DirectedGraph digraph(gType);
auto vertices(pgrouting::extract_vertices(data_edges, total_edges));
digraph.add_vertices(vertices);

Definition at line 462 of file pgr_base_graph.hpp.

463  {
464  pgassert(num_vertices() == 0);
465  for (const auto vertex : vertices) {
466  pgassert(!has_vertex(vertex.id));
467 
468  auto v = add_vertex(graph);
469  vertices_map[vertex.id] = v;
470  graph[v].cp_members(vertex);
471  // put(propmapIndex, v, num_vertices());
472 
473  pgassert(has_vertex(vertex.id));
474  }
475  // pgassert(mapIndex.size() == vertices.size());
476  pgassert(num_vertices() == vertices.size());
477  }

◆ adjacent()

V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::adjacent ( V  v_idx,
E  e_idx 
) const
inlineinherited

Definition at line 562 of file pgr_base_graph.hpp.

562  {
563  pgassert(is_source(v_idx, e_idx) || is_target(v_idx, e_idx));
564  return is_source(v_idx, e_idx)?
565  target(e_idx) :
566  source(e_idx);
567  }

◆ disconnect_edge()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::disconnect_edge ( int64_t  p_from,
int64_t  p_to 
)
inherited

Disconnects all edges from p_from to p_to.

  • No edge is disconnected if the vertices id's do not exist in the graph
  • All removed edges are stored for future reinsertion
  • All parallel edges are disconnected (automatically by boost)
    disconnect_edge(2,3) on an UNDIRECTED graph
disconnect_edge(2,3) on a DIRECTED graph
Parameters
[in]p_fromoriginal vertex id of the starting point of the edge
[in]p_tooriginal vertex id of the ending point of the edge

Definition at line 765 of file pgr_base_graph.hpp.

765  {
766  T_E d_edge;
767 
768  // nothing to do, the vertex doesn't exist
769  if (!has_vertex(p_from) || !has_vertex(p_to)) return;
770 
771  EO_i out, out_end;
772  V g_from(get_V(p_from));
773  V g_to(get_V(p_to));
774 
775  // store the edges that are going to be removed
776  for (boost::tie(out, out_end) = out_edges(g_from, graph);
777  out != out_end; ++out) {
778  if (target(*out) == g_to) {
779  d_edge.id = graph[*out].id;
780  d_edge.source = graph[source(*out)].id;
781  d_edge.target = graph[target(*out)].id;
782  d_edge.cost = graph[*out].cost;
783  removed_edges.push_back(d_edge);
784  }
785  }
786  // the actual removal
787  boost::remove_edge(g_from, g_to, graph);
788 }

◆ disconnect_out_going_edge()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::disconnect_out_going_edge ( int64_t  vertex_id,
int64_t  edge_id 
)
inherited

Disconnects the outgoing edges of a vertex.

  • No edge is disconnected if it doesn't exist in the graph
  • Removed edges are stored for future reinsertion
  • all outgoing edges with the edge_id are removed if they exist
    Parameters
    [in]vertex_idoriginal vertex
    [in]edge_idoriginal edge_id

Definition at line 794 of file pgr_base_graph.hpp.

795  {
796  T_E d_edge;
797 
798  // nothing to do, the vertex doesn't exist
799  if (!has_vertex(vertex_id)) return;
800  auto v_from(get_V(vertex_id));
801 
802  EO_i out, out_end;
803  bool change = true;
804  // store the edge that are going to be removed
805  while (change) {
806  change = false;
807  for (boost::tie(out, out_end) = out_edges(v_from, graph);
808  out != out_end; ++out) {
809  if (graph[*out].id == edge_id) {
810  d_edge.id = graph[*out].id;
811  d_edge.source = graph[source(*out)].id;
812  d_edge.target = graph[target(*out)].id;
813  d_edge.cost = graph[*out].cost;
814  removed_edges.push_back(d_edge);
815  boost::remove_edge((*out), graph);
816  change = true;
817  break;
818  }
819  }
820  }
821 }

◆ disconnect_vertex() [1/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::disconnect_vertex ( int64_t  p_vertex)
inherited

Disconnects all incoming and outgoing edges from the vertex.

boost::graph doesn't recommend th to insert/remove vertices, so a vertex removal is simulated by disconnecting the vertex from the graph

  • No edge is disconnected if the vertices id's do not exist in the graph
  • All removed edges are stored for future reinsertion
  • All parallel edges are disconnected (automatically by boost)
    disconnect_vertex(2) on an UNDIRECTED graph
disconnect_vertex(2) on a DIRECTED graph
Parameters
[in]p_vertexoriginal vertex id of the starting point of the edge

Definition at line 826 of file pgr_base_graph.hpp.

826  {
827  if (!has_vertex(vertex)) return;
828  disconnect_vertex(get_V(vertex));
829 }

◆ disconnect_vertex() [2/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::disconnect_vertex ( V  vertex)
inherited

Definition at line 833 of file pgr_base_graph.hpp.

833  {
834  T_E d_edge;
835 
836  EO_i out, out_end;
837  // store the edges that are going to be removed
838  for (boost::tie(out, out_end) = out_edges(vertex, graph);
839  out != out_end; ++out) {
840  d_edge.id = graph[*out].id;
841  d_edge.source = graph[source(*out)].id;
842  d_edge.target = graph[target(*out)].id;
843  d_edge.cost = graph[*out].cost;
844  removed_edges.push_back(d_edge);
845  }
846 
847  // special case
848  if (m_gType == DIRECTED) {
849  EI_i in, in_end;
850  for (boost::tie(in, in_end) = in_edges(vertex, graph);
851  in != in_end; ++in) {
852  d_edge.id = graph[*in].id;
853  d_edge.source = graph[source(*in)].id;
854  d_edge.target = graph[target(*in)].id;
855  d_edge.cost = graph[*in].cost;
856  removed_edges.push_back(d_edge);
857  }
858  }
859 
860  // delete incoming and outgoing edges from the vertex
861  boost::clear_vertex(vertex, graph);
862 }

◆ find_adjacent_vertices()

template<class G >
Identifiers<V> pgrouting::graph::Pgr_contractionGraph< G >::find_adjacent_vertices ( V  v) const
inline

get the vertex descriptors of adjacent vertices of v

Parameters
[in]vvertex_descriptor
Returns
Identifiers<V>: The set of vertex descriptors adjacent to the given vertex v

Definition at line 69 of file pgr_contractionGraph.hpp.

69  {
70  EO_i out, out_end;
71  EI_i in, in_end;
72  Identifiers<V> adjacent_vertices;
73 
74  for (boost::tie(out, out_end) = out_edges(v, this->graph);
75  out != out_end; ++out) {
76  adjacent_vertices += this->adjacent(v, *out);
77  }
78  for (boost::tie(in, in_end) = in_edges(v, this->graph);
79  in != in_end; ++in) {
80  adjacent_vertices += this->adjacent(v, *in);
81  }
82  return adjacent_vertices;
83  }

References pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::adjacent(), and pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph.

Referenced by pgrouting::graph::Pgr_contractionGraph< G >::is_linear().

◆ get_edge()

E pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::get_edge ( V  from,
V  to,
double &  distance 
) const
inlineinherited

Definition at line 671 of file pgr_base_graph.hpp.

674  {
675  E e;
676  EO_i out_i, out_end;
677  V v_source, v_target;
678  double minCost = (std::numeric_limits<double>::max)();
679  E minEdge;
680  bool valid = false;
681  for (boost::tie(out_i, out_end) = boost::out_edges(from, graph);
682  out_i != out_end; ++out_i) {
683  e = *out_i;
684  if (!valid) {
685  minEdge = e;
686  valid = true;
687  }
688  v_target = target(e);
689  v_source = source(e);
690  if ((from == v_source) && (to == v_target)
691  && (distance == graph[e].cost)) {
692  return e;
693  }
694  if ((from == v_source) && (to == v_target)
695  && (minCost > graph[e].cost)) {
696  minCost = graph[e].cost;
697  minEdge = e;
698  }
699  }
700  return minEdge;
701  }

◆ get_edge_id()

int64_t pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::get_edge_id ( V  from,
V  to,
double &  distance 
) const
inherited

Definition at line 878 of file pgr_base_graph.hpp.

881  {
882  E e;
883  EO_i out_i, out_end;
884  V v_source, v_target;
885  double minCost = (std::numeric_limits<double>::max)();
886  int64_t minEdge = -1;
887  for (boost::tie(out_i, out_end) = boost::out_edges(from, graph);
888  out_i != out_end; ++out_i) {
889  e = *out_i;
890  v_target = target(e);
891  v_source = source(e);
892  if ((from == v_source) && (to == v_target)
893  && (distance == graph[e].cost))
894  return graph[e].id;
895  if ((from == v_source) && (to == v_target)
896  && (minCost > graph[e].cost)) {
897  minCost = graph[e].cost;
898  minEdge = graph[e].id;
899  }
900  }
901  distance = minEdge == -1? 0: minCost;
902  return minEdge;
903 }

◆ get_min_cost_edge()

template<class G >
std::tuple<double, Identifiers<int64_t>, bool> pgrouting::graph::Pgr_contractionGraph< G >::get_min_cost_edge ( V  u,
V  v 
)
inline

get the edge with minimum cost between two vertices

Parameters
[in]uvertex_descriptor of source vertex
[in]vvertex_descriptor of target vertex
Returns
E: The edge descriptor of the edge with minimum cost

Definition at line 92 of file pgr_contractionGraph.hpp.

92  {
93  E min_edge;
94  Identifiers<int64_t> contracted_vertices;
95  double min_cost = (std::numeric_limits<double>::max)();
96  bool found = false;
97 
98  if (this->is_directed()) {
99  BGL_FORALL_OUTEDGES_T(u, e, this->graph, G) {
100  if (this->target(e) == v) {
101  contracted_vertices += this->graph[e].contracted_vertices();
102  if (this->graph[e].cost < min_cost) {
103  min_cost = this->graph[e].cost;
104  min_edge = e;
105  found = true;
106  }
107  }
108  }
109  return std::make_tuple(min_cost, contracted_vertices, found);
110  }
111 
112  pgassert(this->is_undirected());
113  BGL_FORALL_OUTEDGES_T(u, e, this->graph, G) {
114  if (this->adjacent(u, e) == v) {
115  contracted_vertices += this->graph[e].contracted_vertices();
116  if (this->graph[e].cost < min_cost) {
117  min_cost = this->graph[e].cost;
118  min_edge = e;
119  found = true;
120  }
121  }
122  }
123  return std::make_tuple(min_cost, contracted_vertices, found);
124  }

References pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::adjacent(), pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph, pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_directed(), pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_undirected(), pgassert, and pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::target().

◆ get_V() [1/2]

V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::get_V ( const CH_vertex &  vertex)
inlineinherited

get the vertex descriptor of the vertex When the vertex does not exist

  • creates a new vetex
    Returns
    V: The vertex descriptor of the vertex

Definition at line 512 of file pgr_base_graph.hpp.

512  {
513  auto vm_s(vertices_map.find(vertex.id));
514  if (vm_s == vertices_map.end()) {
515  auto v = add_vertex(graph);
516  graph[v].cp_members(vertex);
517  vertices_map[vertex.id] = v;
518  put(propmapIndex, v, num_vertices());
519  return v;
520  }
521  return vm_s->second;
522  }

◆ get_V() [2/2]

V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::get_V ( int64_t  vid) const
inlineinherited

get the vertex descriptor of the vid Call has_vertex(vid) before calling this function

Returns
V: The vertex descriptor of the vertex

Definition at line 528 of file pgr_base_graph.hpp.

528  {
529  pgassert(has_vertex(vid));
530  return vertices_map.find(vid)->second;
531  }

◆ graph_add_edge() [1/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph_add_edge ( const CH_edge &  edge)
inherited

Definition at line 908 of file pgr_base_graph.hpp.

908  {
909  typename Pgr_base_graph< G, T_V, T_E >::LI vm_s, vm_t;
910  typename Pgr_base_graph< G, T_V, T_E >::E e;
911 
912  vm_s = vertices_map.find(edge.source);
913  if (vm_s == vertices_map.end()) {
914  vertices_map[edge.source]= num_vertices();
915  vm_s = vertices_map.find(edge.source);
916  }
917 
918  vm_t = vertices_map.find(edge.target);
919  if (vm_t == vertices_map.end()) {
920  vertices_map[edge.target]= num_vertices();
921  vm_t = vertices_map.find(edge.target);
922  }
923 
924  if (edge.cost >= 0) {
925  bool inserted;
926  boost::tie(e, inserted) =
927  boost::add_edge(vm_s->second, vm_t->second, graph);
928  graph[e].cp_members(edge);
929  }
930 }

◆ graph_add_edge() [2/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph_add_edge ( const T &  edge,
bool  normal = true 
)
inherited

Definition at line 936 of file pgr_base_graph.hpp.

936  {
937  bool inserted;
938  typename Pgr_base_graph< G, T_V, T_E >::E e;
939  if ((edge.cost < 0) && (edge.reverse_cost < 0))
940  return;
941 
942  /*
943  * true: for source
944  * false: for target
945  */
946  auto vm_s = get_V(T_V(edge, true));
947  auto vm_t = get_V(T_V(edge, false));
948 
949  pgassert(vertices_map.find(edge.source) != vertices_map.end());
950  pgassert(vertices_map.find(edge.target) != vertices_map.end());
951  if (edge.cost >= 0) {
952  boost::tie(e, inserted) =
953  boost::add_edge(vm_s, vm_t, graph);
954  graph[e].cost = edge.cost;
955  graph[e].id = edge.id;
956  }
957 
958  if (edge.reverse_cost >= 0
959  && (m_gType == DIRECTED
960  || (m_gType == UNDIRECTED && edge.cost != edge.reverse_cost))) {
961  boost::tie(e, inserted) =
962  boost::add_edge(vm_t, vm_s, graph);
963 
964  graph[e].cost = edge.reverse_cost;
965  graph[e].id = normal? edge.id : -edge.id;
966  }
967 }

◆ graph_add_edge_no_create_vertex()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph_add_edge_no_create_vertex ( const T &  edge)
inlineinherited

Use this function when the vertices are already inserted in the graph.

Definition at line 721 of file pgr_base_graph.hpp.

721  {
722  bool inserted;
723  E e;
724  if ((edge.cost < 0) && (edge.reverse_cost < 0))
725  return;
726 
727 #if 0
728  std::ostringstream log;
729  for (auto iter = vertices_map.begin();
730  iter != vertices_map.end();
731  iter++) {
732  log << "Key: " << iter->first <<"\tValue:" << iter->second << "\n";
733  }
734  pgassertwm(has_vertex(edge.source), log.str().c_str());
735  pgassert(has_vertex(edge.target));
736 #endif
737 
738  auto vm_s = get_V(edge.source);
739  auto vm_t = get_V(edge.target);
740 
741 
742  if (edge.cost >= 0) {
743  boost::tie(e, inserted) =
744  boost::add_edge(vm_s, vm_t, graph);
745  graph[e].cost = edge.cost;
746  graph[e].id = edge.id;
747  }
748 
749 
750  if (edge.reverse_cost >= 0 && (is_directed()
751  || (is_undirected() && edge.cost != edge.reverse_cost))) {
752  boost::tie(e, inserted) =
753  boost::add_edge(vm_t, vm_s, graph);
754  graph[e].cost = edge.reverse_cost;
755  graph[e].id = edge.id;
756  }
757  }

◆ graph_add_min_edge_no_parallel()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph_add_min_edge_no_parallel ( const T &  edge)
inherited

Definition at line 972 of file pgr_base_graph.hpp.

972  {
973  bool inserted;
974  typename Pgr_base_graph< G, T_V, T_E >::E e;
975  if ((edge.cost < 0) && (edge.reverse_cost < 0))
976  return;
977 
978  /*
979  * true: for source
980  * false: for target
981  */
982  auto vm_s = get_V(T_V(edge, true));
983  auto vm_t = get_V(T_V(edge, false));
984 
985  pgassert(vertices_map.find(edge.source) != vertices_map.end());
986  pgassert(vertices_map.find(edge.target) != vertices_map.end());
987  if (edge.cost >= 0) {
988  E e1;
989  bool found;
990  boost::tie(e1, found) = edge(vm_s, vm_t, graph);
991  if (found) {
992  if (edge.cost < graph[e1].cost) {
993  graph[e1].cost = edge.cost;
994  graph[e1].id = edge.id;
995  }
996  } else {
997  boost::tie(e, inserted) =
998  boost::add_edge(vm_s, vm_t, graph);
999  graph[e].cost = edge.cost;
1000  graph[e].id = edge.id;
1001  }
1002  }
1003 
1004  if (edge.reverse_cost >= 0
1005  && (m_gType == DIRECTED
1006  || (m_gType == UNDIRECTED && edge.cost != edge.reverse_cost))) {
1007  E e1;
1008  bool found;
1009  boost::tie(e1, found) = edge(vm_t, vm_s, graph);
1010  if (found) {
1011  if (edge.reverse_cost < graph[e1].cost) {
1012  graph[e1].cost = edge.reverse_cost;
1013  graph[e1].id = edge.id;
1014  }
1015  } else {
1016  boost::tie(e, inserted) =
1017  boost::add_edge(vm_t, vm_s, graph);
1018 
1019  graph[e].cost = edge.reverse_cost;
1020  graph[e].id = edge.id;
1021  }
1022  }
1023 }

◆ graph_add_neg_edge()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph_add_neg_edge ( const T &  edge,
bool  normal = true 
)
inherited

Definition at line 1035 of file pgr_base_graph.hpp.

1035  {
1036  bool inserted;
1037  typename Pgr_base_graph< G, T_V, T_E >::E e;
1038 
1039  auto vm_s = get_V(T_V(edge, true));
1040  auto vm_t = get_V(T_V(edge, false));
1041 
1042  pgassert(vertices_map.find(edge.source) != vertices_map.end());
1043  pgassert(vertices_map.find(edge.target) != vertices_map.end());
1044 
1045  boost::tie(e, inserted) =
1046  boost::add_edge(vm_s, vm_t, graph);
1047  if (edge.cost < 0) {
1048  // reading negative edges as positive
1049  graph[e].cost = (-0.5)*edge.cost;
1050  } else {
1051  graph[e].cost = edge.cost;
1052  }
1053  graph[e].id = edge.id;
1054 
1055  if (m_gType == DIRECTED
1056  || (m_gType == UNDIRECTED && edge.cost > edge.reverse_cost)) {
1057  boost::tie(e, inserted) =
1058  boost::add_edge(vm_t, vm_s, graph);
1059  if (edge.reverse_cost < 0) {
1060  // reading negative edges as positive
1061  graph[e].cost = (-0.5)*edge.reverse_cost;
1062  } else {
1063  graph[e].cost = edge.reverse_cost;
1064  }
1065 
1066  graph[e].id = normal? edge.id : -edge.id;
1067  }
1068 }

◆ has_u_v_w()

template<class G >
bool pgrouting::graph::Pgr_contractionGraph< G >::has_u_v_w ( V  u,
V  v,
V  w 
) const
inline

Definition at line 181 of file pgr_contractionGraph.hpp.

181  {
182  return boost::edge(u, v, this->graph).second && boost::edge(v, w, this->graph).second;
183  }

References pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph.

Referenced by pgrouting::graph::Pgr_contractionGraph< G >::is_shortcut_possible().

◆ has_vertex()

bool pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::has_vertex ( int64_t  vid) const
inlineinherited

True when vid is in the graph.

Definition at line 534 of file pgr_base_graph.hpp.

534  {
535  return vertices_map.find(vid) != vertices_map.end();
536  }

◆ in_degree() [1/2]

degree_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::in_degree ( int64_t  vertex_id) const
inlineinherited

Definition at line 497 of file pgr_base_graph.hpp.

497  {
498  if (!has_vertex(vertex_id)) {
499  return 0;
500  }
501  return is_directed()?
502  in_degree(get_V(vertex_id))
503  : out_degree(get_V(vertex_id));
504  }

◆ in_degree() [2/2]

degree_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::in_degree ( V &  v) const
inlineinherited

in degree of a vertex

  • when its undirected there is no "concept" of in degree
    • out degree is returned
  • on directed in degree of vertex is returned

Definition at line 576 of file pgr_base_graph.hpp.

576  {
577  return is_directed()?
578  boost::in_degree(v, graph) :
579  boost::out_degree(v, graph);
580  }

◆ insert_edges() [1/3]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_edges ( const std::vector< T > &  edges,
bool  normal = true 
)
inlineinherited

Inserts count edges of type pgr_edge_t into the graph The set of edges should not have an illegal vertex defined When the graph is empty calls:

  • extract_vertices and throws an exception if there are illegal vertices. When developing:
    • if an illegal vertex is found an exception is thrown
    • That means that the set of vertices should be checked in the code that is being developed No edge is inserted when there is an error on the vertices
      Parameters
      edges
      normal

Definition at line 395 of file pgr_base_graph.hpp.

395  {
396 #if 0
397  // This code does not work with contraction
398  if (num_vertices() == 0) {
399  auto vertices = pgrouting::extract_vertices(edges);
400  pgassert(pgrouting::check_vertices(vertices) == 0);
401  add_vertices(vertices);
402  }
403 #endif
404  for (const auto edge : edges) {
405  graph_add_edge(edge, normal);
406  }
407  }

◆ insert_edges() [2/3]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_edges ( const T *  edges,
size_t  count 
)
inlineinherited

Inserts count edges of type T into the graph.

Converts the edges to a std::vector<T> & calls the overloaded twin function.

Parameters
edges
count

Definition at line 357 of file pgr_base_graph.hpp.

357  {
358  insert_edges(std::vector < T >(edges, edges + count));
359  }

◆ insert_edges() [3/3]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_edges ( T *  edges,
size_t  count,
bool   
)
inlineinherited

Definition at line 367 of file pgr_base_graph.hpp.

367  {
368  for (size_t i = 0; i < count; ++i) {
369  pgassert(has_vertex(edges[i].source));
370  pgassert(has_vertex(edges[i].target));
371  graph_add_edge_no_create_vertex(edges[i]);
372  }
373  }

◆ insert_edges_neg()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_edges_neg ( const T *  edges,
size_t  count 
)
inlineinherited

Definition at line 362 of file pgr_base_graph.hpp.

362  {
363  insert_edges(std::vector < T >(edges, edges + count), false);
364  }

◆ insert_min_edges_no_parallel() [1/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_min_edges_no_parallel ( const std::vector< T > &  edges)
inlineinherited

Definition at line 416 of file pgr_base_graph.hpp.

416  {
417  for (const auto edge : edges) {
418  graph_add_min_edge_no_parallel(edge);
419  }
420  }

◆ insert_min_edges_no_parallel() [2/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_min_edges_no_parallel ( const T *  edges,
size_t  count 
)
inlineinherited

Definition at line 410 of file pgr_base_graph.hpp.

410  {
411  insert_edges(std::vector<T>(edges, edges + count));
412  }

◆ insert_negative_edges() [1/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_negative_edges ( const std::vector< T > &  edges,
bool  normal = true 
)
inlineinherited

Definition at line 423 of file pgr_base_graph.hpp.

425  {
426  for (const auto edge : edges) {
427  graph_add_neg_edge(edge, normal);
428  }
429  }

◆ insert_negative_edges() [2/2]

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::insert_negative_edges ( const T *  edges,
int64_t  count 
)
inlineinherited

Definition at line 376 of file pgr_base_graph.hpp.

376  {
377  insert_negative_edges(std::vector < T >(edges, edges + count));
378  }

◆ is_directed()

bool pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::is_directed
inlineinherited

Definition at line 543 of file pgr_base_graph.hpp.

543 {return m_gType == DIRECTED;}

◆ is_linear()

template<class G >
bool pgrouting::graph::Pgr_contractionGraph< G >::is_linear ( V  v)
inline

Definition at line 241 of file pgr_contractionGraph.hpp.

241  {
242  // Checking adjacent vertices constraint
243  auto adjacent_vertices = find_adjacent_vertices(v);
244 
245  if (adjacent_vertices.size() == 2) {
246  // Checking u - v - w
247  V u = adjacent_vertices.front();
248  adjacent_vertices.pop_front();
249  V w = adjacent_vertices.front();
250  adjacent_vertices.pop_front();
251  if (is_shortcut_possible(u, v, w)) {
252  return true;
253  }
254  return false;
255  }
256  return false;
257  }

References pgrouting::graph::Pgr_contractionGraph< G >::find_adjacent_vertices(), and pgrouting::graph::Pgr_contractionGraph< G >::is_shortcut_possible().

◆ is_shortcut_possible()

template<class G >
bool pgrouting::graph::Pgr_contractionGraph< G >::is_shortcut_possible ( V  u,
V  v,
V  w 
)
inline

Possibility of a shortcut from left vertex to right vertex v* should be a linear vertex u <-> v -> w: v not considered linear.

dot_inline_dotgraph_2.png

Definition at line 208 of file pgr_contractionGraph.hpp.

211  {
212  if (u == v || v == w || u == w) return false;
213  pgassert(u != v);
214  pgassert(v != w);
215  pgassert(u != w);
216  if (this->is_undirected()) {
217  /*
218  * u - v - w
219  */
220  return has_u_v_w(u, v, w);
221  }
222 
223  pgassert(this->is_directed());
224  return
225  /*
226  * u <-> v <-> w
227  */
228  (has_u_v_w(u, v, w) && has_u_v_w(w, v, u))
229  /*
230  * u -> v -> w
231  */
232  ||
233  (has_u_v_w(u, v, w) && !(boost::edge(v, u, this->graph).second || boost::edge(w, v, this->graph).second))
234  /*
235  * u <- v <- w
236  */
237  ||
238  (has_u_v_w(w, v, u) && !(boost::edge(v, w, this->graph).second || boost::edge(u, v, this->graph).second));
239  }

References pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph, pgrouting::graph::Pgr_contractionGraph< G >::has_u_v_w(), pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_directed(), pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_undirected(), and pgassert.

Referenced by pgrouting::graph::Pgr_contractionGraph< G >::is_linear().

◆ is_source()

bool pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::is_source ( V  v_idx,
E  e_idx 
) const
inlineinherited

Definition at line 545 of file pgr_base_graph.hpp.

545 {return v_idx == source(e_idx);}

◆ is_target()

bool pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::is_target ( V  v_idx,
E  e_idx 
) const
inlineinherited

Definition at line 546 of file pgr_base_graph.hpp.

546 {return v_idx == target(e_idx);}

◆ is_undirected()

bool pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::is_undirected
inlineinherited

Definition at line 544 of file pgr_base_graph.hpp.

544 {return m_gType == UNDIRECTED;}

◆ num_edges()

size_t pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::num_edges
inlineinherited

Definition at line 704 of file pgr_base_graph.hpp.

704 { return boost::num_edges(graph);}

◆ num_vertices()

size_t pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::num_vertices
inlineinherited

Definition at line 703 of file pgr_base_graph.hpp.

703 { return boost::num_vertices(graph);}

◆ operator[]() [1/4]

CH_edge & pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::operator[] ( E  e_idx)
inlineinherited

Definition at line 554 of file pgr_base_graph.hpp.

554 {return graph[e_idx];}

◆ operator[]() [2/4]

const CH_edge & pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::operator[] ( E  e_idx) const
inlineinherited

Definition at line 555 of file pgr_base_graph.hpp.

555 {return graph[e_idx];}

◆ operator[]() [3/4]

CH_vertex & pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::operator[] ( V  v_idx)
inlineinherited

Definition at line 557 of file pgr_base_graph.hpp.

557 {return graph[v_idx];}

◆ operator[]() [4/4]

const CH_vertex & pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::operator[] ( V  v_idx) const
inlineinherited

Definition at line 558 of file pgr_base_graph.hpp.

558 {return graph[v_idx];}

◆ out_degree() [1/2]

degree_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::out_degree ( int64_t  vertex_id) const
inlineinherited

get the out-degree of a vertex

Returns
0: The out degree of a vertex that its not in the graph
Parameters
[in]vertex_idoriginal vertex id

Definition at line 489 of file pgr_base_graph.hpp.

489  {
490  if (!has_vertex(vertex_id)) {
491  return 0;
492  }
493  auto v = get_V(vertex_id);
494  auto d = out_degree(v);
495  return d;
496  }

◆ out_degree() [2/2]

degree_size_type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::out_degree ( V &  v) const
inlineinherited

out degree of a vertex

regardles of undirected or directed graph

  • out degree is returned

Definition at line 587 of file pgr_base_graph.hpp.

587  {
588  return boost::out_degree(v, graph);
589  }

◆ restore_graph()

void pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::restore_graph
inherited

Reconnects all edges that were removed.

Definition at line 866 of file pgr_base_graph.hpp.

866  {
867  while (removed_edges.size() != 0) {
868  graph_add_edge(removed_edges[0]);
869  removed_edges.pop_front();
870  }
871 }

◆ source()

V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::source ( E  e_idx) const
inlineinherited

Definition at line 560 of file pgr_base_graph.hpp.

560 {return boost::source(e_idx, graph);}

◆ target()

V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::target ( E  e_idx) const
inlineinherited

Definition at line 561 of file pgr_base_graph.hpp.

561 {return boost::target(e_idx, graph);}

Friends And Related Function Documentation

◆ operator<<

template<class G >
std::ostream& operator<< ( std::ostream &  os,
const Pgr_contractionGraph< G > &  g 
)
friend

print the graph with contracted vertices of all vertices and edges

Definition at line 131 of file pgr_contractionGraph.hpp.

133  {
134  EO_i out, out_end;
135  for (auto vi = vertices(g.graph).first;
136  vi != vertices(g.graph).second;
137  ++vi) {
138  if ((*vi) >= g.num_vertices()) break;
139  os << g.graph[*vi].id << "(" << (*vi) << ")"
140  << g.graph[*vi].contracted_vertices() << std::endl;
141  os << " out_edges_of(" << g.graph[*vi].id << "):";
142  for (boost::tie(out, out_end) = out_edges(*vi, g.graph);
143  out != out_end; ++out) {
144  os << ' ' << g.graph[*out].id
145  << "=(" << g.graph[g.source(*out)].id
146  << ", " << g.graph[g.target(*out)].id << ") = "
147  << g.graph[*out].cost <<"\t";
148  }
149  os << std::endl;
150  }
151  return os;
152  }

Member Data Documentation

◆ graph

G pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::graph
inherited

The graph.

Definition at line 260 of file pgr_base_graph.hpp.

◆ m_gType

graphType pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::m_gType
inherited

type (DIRECTED or UNDIRECTED)

Definition at line 261 of file pgr_base_graph.hpp.

◆ mapIndex

IndexMap pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::mapIndex
inherited

Definition at line 272 of file pgr_base_graph.hpp.

◆ propmapIndex

boost::associative_property_map<IndexMap> pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::propmapIndex
inherited

Definition at line 273 of file pgr_base_graph.hpp.

◆ removed_edges

std::deque< CH_edge > pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::removed_edges
inherited

Used for storing the removed_edges.

Definition at line 281 of file pgr_base_graph.hpp.

◆ vertices_map

id_to_V pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::vertices_map
inherited

id -> graph id

Definition at line 267 of file pgr_base_graph.hpp.

◆ vertIndex

boost::property_map<G, boost::vertex_index_t>::type pgrouting::graph::Pgr_base_graph< G, CH_vertex , CH_edge >::vertIndex
inherited

Definition at line 269 of file pgr_base_graph.hpp.

The documentation for this class was generated from the following file:
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph_add_edge_no_create_vertex
void graph_add_edge_no_create_vertex(const T &edge)
Use this function when the vertices are already inserted in the graph.
Definition: pgr_base_graph.hpp:721
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::propmapIndex
boost::associative_property_map< IndexMap > propmapIndex
Definition: pgr_base_graph.hpp:273
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph
G graph
The graph.
Definition: pgr_base_graph.hpp:260
edge::reverse_cost
float8 reverse_cost
Definition: trsp.h:46
pgrouting::graph::Pgr_contractionGraph::V
boost::graph_traits< G >::vertex_descriptor V
Definition: pgr_contractionGraph.hpp:53
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::insert_negative_edges
void insert_negative_edges(const T *edges, int64_t count)
Definition: pgr_base_graph.hpp:376
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::out_degree
degree_size_type out_degree(int64_t vertex_id) const
get the out-degree of a vertex
Definition: pgr_base_graph.hpp:489
edge::cost
float8 cost
Definition: trsp.h:45
edge::target
int64 target
Definition: trsp.h:44
pgrouting::graph::Pgr_contractionGraph::E
boost::graph_traits< G >::edge_descriptor E
Definition: pgr_contractionGraph.hpp:54
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::m_gType
graphType m_gType
type (DIRECTED or UNDIRECTED)
Definition: pgr_base_graph.hpp:261
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_source
bool is_source(V v_idx, E e_idx) const
Definition: pgr_base_graph.hpp:545
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::target
V target(E e_idx) const
Definition: pgr_base_graph.hpp:561
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::EI_i
boost::graph_traits< G >::in_edge_iterator EI_i
Definition: pgr_base_graph.hpp:234
pgrouting::check_vertices
size_t check_vertices(std::vector< Basic_vertex > vertices)
Definition: basic_vertex.cpp:42
pgassertwm
#define pgassertwm(expr, msg)
Adds a message to the assertion.
Definition: pgr_assert.h:117
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::has_vertex
bool has_vertex(int64_t vid) const
True when vid is in the graph.
Definition: pgr_base_graph.hpp:534
edge
Definition: trsp.h:41
pgassert
#define pgassert(expr)
Uses the standard assert syntax.
Definition: pgr_assert.h:94
pgrouting::graph::Pgr_contractionGraph::is_shortcut_possible
bool is_shortcut_possible(V u, V v, V w)
Possibility of a shortcut from left vertex to right vertex v* should be a linear vertex u <-> v -> w:...
Definition: pgr_contractionGraph.hpp:208
UNDIRECTED
@ UNDIRECTED
Definition: graph_enum.h:30
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::insert_edges
void insert_edges(const T *edges, size_t count)
Inserts count edges of type T into the graph.
Definition: pgr_base_graph.hpp:357
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::get_V
V get_V(const CH_vertex &vertex)
get the vertex descriptor of the vertex When the vertex does not exist
Definition: pgr_base_graph.hpp:512
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_target
bool is_target(V v_idx, E e_idx) const
Definition: pgr_base_graph.hpp:546
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph_add_neg_edge
void graph_add_neg_edge(const T &edge, bool normal=true)
Definition: pgr_base_graph.hpp:1035
pgrouting::alphashape::E
boost::graph_traits< BG >::edge_descriptor E
Definition: pgr_alphaShape.h:57
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::source
V source(E e_idx) const
Definition: pgr_base_graph.hpp:560
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::E
boost::graph_traits< G >::edge_descriptor E
Definition: pgr_base_graph.hpp:230
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_directed
bool is_directed() const
Definition: pgr_base_graph.hpp:543
edge::source
int64 source
Definition: trsp.h:43
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::num_vertices
size_t num_vertices() const
Definition: pgr_base_graph.hpp:703
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::removed_edges
std::deque< CH_edge > removed_edges
Used for storing the removed_edges.
Definition: pgr_base_graph.hpp:281
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::add_vertices
void add_vertices(std::vector< CH_vertex > vertices)
adds the vertices into the graph
Definition: pgr_base_graph.hpp:462
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::EO_i
boost::graph_traits< G >::out_edge_iterator EO_i
Definition: pgr_base_graph.hpp:233
DIRECTED
@ DIRECTED
Definition: graph_enum.h:30
pgrouting::graph::Pgr_contractionGraph::EO_i
boost::graph_traits< G >::out_edge_iterator EO_i
Definition: pgr_contractionGraph.hpp:55
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::is_undirected
bool is_undirected() const
Definition: pgr_base_graph.hpp:544
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph_add_min_edge_no_parallel
void graph_add_min_edge_no_parallel(const T &edge)
Definition: pgr_base_graph.hpp:972
edge::id
int64 id
Definition: trsp.h:42
pgrouting::alphashape::G
graph::Pgr_base_graph< BG, XY_vertex, Basic_edge > G
Definition: pgr_alphaShape.h:56
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::V
boost::graph_traits< G >::vertex_descriptor V
Definition: pgr_base_graph.hpp:229
pgrouting::graph::Pgr_contractionGraph::find_adjacent_vertices
Identifiers< V > find_adjacent_vertices(V v) const
get the vertex descriptors of adjacent vertices of v
Definition: pgr_contractionGraph.hpp:69
pgrouting::graph::Pgr_contractionGraph::EI_i
boost::graph_traits< G >::in_edge_iterator EI_i
Definition: pgr_contractionGraph.hpp:56
pgrouting::graph::Pgr_base_graph
Definition: pgr_base_graph.hpp:168
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::graph_add_edge
void graph_add_edge(const CH_edge &edge)
Definition: pgr_base_graph.hpp:908
pgrouting::graph::Pgr_contractionGraph::has_u_v_w
bool has_u_v_w(V u, V v, V w) const
Definition: pgr_contractionGraph.hpp:181
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::disconnect_vertex
void disconnect_vertex(int64_t p_vertex)
Disconnects all incoming and outgoing edges from the vertex.
Definition: pgr_base_graph.hpp:826
pgrouting::extract_vertices
std::vector< Basic_vertex > extract_vertices(std::vector< Basic_vertex > vertices, const std::vector< pgr_edge_t > data_edges)
Definition: basic_vertex.cpp:59
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::in_degree
degree_size_type in_degree(int64_t vertex_id) const
Definition: pgr_base_graph.hpp:497
Identifiers< V >
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::vertices_map
id_to_V vertices_map
id -> graph id
Definition: pgr_base_graph.hpp:267
pgrouting::graph::Pgr_base_graph< G, CH_vertex, CH_edge >::adjacent
V adjacent(V v_idx, E e_idx) const
Definition: pgr_base_graph.hpp:562