|
|
|
Graph simplicial complex methods. More...
Go to the source code of this file.
Namespaces | |
| namespace | Gudhi |
| Gudhi namespace. | |
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.