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... | |
Graph simplicial complex methods.
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.
SimplicialComplexForProximityGraph | furnishes Filtration_value type definition. |
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.
SimplicialComplexForProximityGraph | furnishes Filtration_value and Vertex_handle type definitions. |
ForwardPointRange | furnishes .begin() and .end() methods. |
Distance | furnishes operator()(const Point& p1, const Point& p2) , where Point is a point from the ForwardPointRange , and that returns a Filtration_value . |