graph_simplicial_complex.h File Reference

Graph simplicial complex methods. More...

Go to the source code of this file.

Typedefs

template<typename SimplicialComplexForProximityGraph >
using Gudhi::Proximity_graph = typename boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, boost::property< vertex_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value >, boost::property< edge_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value > >
 Proximity_graph contains the vertices and edges with their filtration values in order to store the result of Gudhi::compute_proximity_graph function. More...
 

Functions

template<typename SimplicialComplexForProximityGraph , typename ForwardPointRange , typename Distance >
Proximity_graph< SimplicialComplexForProximityGraph > Gudhi::compute_proximity_graph (const ForwardPointRange &points, typename SimplicialComplexForProximityGraph::Filtration_value threshold, Distance distance)
 Computes the proximity graph of the points. More...
 

Detailed Description

Graph simplicial complex methods.

Typedef Documentation

◆ Proximity_graph

template<typename SimplicialComplexForProximityGraph >
using Gudhi::Proximity_graph = typedef typename boost::adjacency_list < boost::vecS, boost::vecS, boost::directedS , boost::property < vertex_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value > , boost::property < edge_filtration_t, typename SimplicialComplexForProximityGraph::Filtration_value > >

Proximity_graph contains the vertices and edges with their filtration values in order to store the result of Gudhi::compute_proximity_graph function.

Template Parameters
SimplicialComplexForProximityGraphfurnishes Filtration_value type definition.

Function Documentation

◆ compute_proximity_graph()

template<typename SimplicialComplexForProximityGraph , typename ForwardPointRange , typename Distance >
Proximity_graph<SimplicialComplexForProximityGraph> Gudhi::compute_proximity_graph ( const ForwardPointRange &  points,
typename SimplicialComplexForProximityGraph::Filtration_value  threshold,
Distance  distance 
)

Computes the proximity graph of the points.

If points contains n elements, the proximity graph is the graph with n vertices, and an edge [u,v] iff the distance function between points u and v is smaller than threshold.

Template Parameters
SimplicialComplexForProximityGraphfurnishes Filtration_value and Vertex_handle type definitions.
ForwardPointRangefurnishes .begin() and .end() methods.
Distancefurnishes operator()(const Point& p1, const Point& p2), where Point is a point from the ForwardPointRange, and that returns a Filtration_value.
Examples:
Simplex_tree/cech_complex_cgal_mini_sphere_3d.cpp.
GUDHI  Version 3.4.1  - C++ library for Topological Data Analysis (TDA) and Higher Dimensional Geometry Understanding.  - Copyright : MIT Generated on Fri Jan 22 2021 09:41:16 for GUDHI by Doxygen 1.8.13