11 #ifndef GRAPH_SIMPLICIAL_COMPLEX_H_
12 #define GRAPH_SIMPLICIAL_COMPLEX_H_
14 #include <boost/graph/adjacency_list.hpp>
24 struct edge_filtration_t {
25 typedef boost::edge_property_tag kind;
29 struct vertex_filtration_t {
30 typedef boost::vertex_property_tag kind;
39 template <
typename SimplicialComplexForProximityGraph>
40 using Proximity_graph =
typename boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS
41 , boost::property < vertex_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >
42 , boost::property < edge_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >>;
54 template<
typename SimplicialComplexForProximityGraph
55 ,
typename ForwardPointRange
57 Proximity_graph<SimplicialComplexForProximityGraph> compute_proximity_graph(
58 const ForwardPointRange& points,
59 typename SimplicialComplexForProximityGraph::Filtration_value threshold,
61 using Vertex_handle =
typename SimplicialComplexForProximityGraph::Vertex_handle;
62 using Filtration_value =
typename SimplicialComplexForProximityGraph::Filtration_value;
64 std::vector<std::pair< Vertex_handle, Vertex_handle >> edges;
65 std::vector< Filtration_value > edges_fil;
66 std::map< Vertex_handle, Filtration_value > vertices;
68 Vertex_handle idx_u, idx_v;
71 for (
auto it_u = points.begin(); it_u != points.end(); ++it_u) {
73 for (
auto it_v = it_u + 1; it_v != points.end(); ++it_v, ++idx_v) {
74 fil = distance(*it_u, *it_v);
75 if (fil <= threshold) {
76 edges.emplace_back(idx_u, idx_v);
77 edges_fil.push_back(fil);
84 Proximity_graph<SimplicialComplexForProximityGraph> skel_graph(edges.begin(), edges.end(), edges_fil.begin(), idx_u);
86 auto vertex_prop = boost::get(vertex_filtration_t(), skel_graph);
88 typename boost::graph_traits<Proximity_graph<SimplicialComplexForProximityGraph>>::vertex_iterator vi, vi_end;
89 for (std::tie(vi, vi_end) = boost::vertices(skel_graph);
91 boost::put(vertex_prop, *vi, 0.);
99 #endif // GRAPH_SIMPLICIAL_COMPLEX_H_