summaryrefslogtreecommitdiff
path: root/src/Bitmap_cubical_complex/example
diff options
context:
space:
mode:
authorvrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2017-11-16 09:47:15 +0000
committervrouvrea <vrouvrea@636b058d-ea47-450e-bf9e-a15bfbe3eedb>2017-11-16 09:47:15 +0000
commit482b83945da409e7b748a0ecad56bbfdb569939b (patch)
tree3c4765f87e335ab5160b747bb1bb2204b872b453 /src/Bitmap_cubical_complex/example
parentaafe601c247c78a474c6af110ca5b34540a34f44 (diff)
parentc438bf42d79c464104755108440d70b5dc2abf0b (diff)
Merge last trunk modifications
Fix doxygen warnings git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/add_utils_in_gudhi_v2@2888 636b058d-ea47-450e-bf9e-a15bfbe3eedb Former-commit-id: b80b28a10495b6f2519b53885b1bf31be85ed7ac
Diffstat (limited to 'src/Bitmap_cubical_complex/example')
-rw-r--r--src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp19
1 files changed, 9 insertions, 10 deletions
diff --git a/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp b/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
index 16ad65a0..f70558f2 100644
--- a/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
+++ b/src/Bitmap_cubical_complex/example/Random_bitmap_cubical_complex.cpp
@@ -20,7 +20,6 @@
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-
// for persistence algorithm
#include <gudhi/reader_utils.h>
#include <gudhi/Bitmap_cubical_complex.h>
@@ -34,10 +33,11 @@
int main(int argc, char** argv) {
srand(time(0));
- std::cout << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical " <<
- "complexes. The first parameter of the program is the dimension D of the bitmap. The next D parameters are " <<
- "number of top dimensional cubes in each dimension of the bitmap. The program will create random cubical " <<
- "complex of that sizes and compute persistent homology of it." << std::endl;
+ std::cout
+ << "This program computes persistent homology, by using bitmap_cubical_complex class, of cubical "
+ << "complexes. The first parameter of the program is the dimension D of the bitmap. The next D parameters are "
+ << "number of top dimensional cubes in each dimension of the bitmap. The program will create random cubical "
+ << "complex of that sizes and compute persistent homology of it." << std::endl;
int p = 2;
double min_persistence = 0;
@@ -47,16 +47,16 @@ int main(int argc, char** argv) {
return 1;
}
- size_t dimensionOfBitmap = (size_t) atoi(argv[1]);
- std::vector< unsigned > sizes;
+ size_t dimensionOfBitmap = (size_t)atoi(argv[1]);
+ std::vector<unsigned> sizes;
size_t multipliers = 1;
for (size_t dim = 0; dim != dimensionOfBitmap; ++dim) {
- unsigned sizeInThisDimension = (unsigned) atoi(argv[2 + dim]);
+ unsigned sizeInThisDimension = (unsigned)atoi(argv[2 + dim]);
sizes.push_back(sizeInThisDimension);
multipliers *= sizeInThisDimension;
}
- std::vector< double > data;
+ std::vector<double> data;
for (size_t i = 0; i != multipliers; ++i) {
data.push_back(rand() / static_cast<double>(RAND_MAX));
}
@@ -80,4 +80,3 @@ int main(int argc, char** argv) {
return 0;
}
-