diff options
| author | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-09-28 11:15:34 +0000 |
|---|---|---|
| committer | vrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb> | 2016-09-28 11:15:34 +0000 |
| commit | ca6b3d72f2114cdd2d0899fd44dba19303dd3bb2 (patch) | |
| tree | bd91fbacb7e63277c5e0ab67d8f5960269941101 /src/common | |
| parent | 2b5800ffe72016dd509028196ddcc36904e49829 (diff) | |
Add rips complex module and first modification step
git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/rips_complex_module@1577 636b058d-ea47-450e-bf9e-a15bfbe3eedb
Former-commit-id: fc949570c6cffa4756f84a15c41fadc8c45b2af2
Diffstat (limited to 'src/common')
| -rw-r--r-- | src/common/include/gudhi/distance_functions.h | 2 | ||||
| -rw-r--r-- | src/common/include/gudhi/graph_simplicial_complex.h | 8 |
2 files changed, 5 insertions, 5 deletions
diff --git a/src/common/include/gudhi/distance_functions.h b/src/common/include/gudhi/distance_functions.h index cd518581..b2726ba8 100644 --- a/src/common/include/gudhi/distance_functions.h +++ b/src/common/include/gudhi/distance_functions.h @@ -29,7 +29,7 @@ * by a range of coordinates. The points are assumed to have * the same dimension. */ template< typename Point > -double euclidean_distance(Point &p1, Point &p2) { +double euclidean_distance(const Point &p1,const Point &p2) { double dist = 0.; auto it1 = p1.begin(); auto it2 = p2.begin(); diff --git a/src/common/include/gudhi/graph_simplicial_complex.h b/src/common/include/gudhi/graph_simplicial_complex.h index 042ef516..773889d9 100644 --- a/src/common/include/gudhi/graph_simplicial_complex.h +++ b/src/common/include/gudhi/graph_simplicial_complex.h @@ -39,14 +39,14 @@ struct vertex_filtration_t { typedef boost::vertex_property_tag kind; }; -typedef int Vertex_handle; +/*typedef int Vertex_handle; typedef double Filtration_value; typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS , boost::property < vertex_filtration_t, Filtration_value > , boost::property < edge_filtration_t, Filtration_value > > Graph_t; typedef std::pair< Vertex_handle, Vertex_handle > Edge_t; - +*/ /** \brief Output the proximity graph of the points. * * If points contains n elements, the proximity graph is the graph @@ -56,7 +56,7 @@ typedef std::pair< Vertex_handle, Vertex_handle > Edge_t; * The type PointCloud furnishes .begin() and .end() methods, that return * iterators with value_type Point. */ -template< typename PointCloud +/*template< typename PointCloud , typename Point > Graph_t compute_proximity_graph(PointCloud &points , Filtration_value threshold @@ -94,6 +94,6 @@ Graph_t compute_proximity_graph(PointCloud &points } return skel_graph; -} +}*/ #endif // GRAPH_SIMPLICIAL_COMPLEX_H_ |