summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorjan.reininghaus <jan.reininghaus@8e3bb3c2-eed4-f18f-5264-0b6c94e6926d>2013-04-22 09:54:40 +0000
committerjan.reininghaus <jan.reininghaus@8e3bb3c2-eed4-f18f-5264-0b6c94e6926d>2013-04-22 09:54:40 +0000
commit6119cf9deec63c756a4d022655e46df319d42c92 (patch)
treeed010f0e872c7d9b2a56a05a5a565550cc835298
parent0d478dbf1dab43a5998c33ec241d0b00434853dd (diff)
changed self_test to bit_tree_pivot_column representationv1.1
git-svn-id: https://phat.googlecode.com/svn/trunk@36 8e3bb3c2-eed4-f18f-5264-0b6c94e6926d
-rw-r--r--src/self_test.cpp18
1 files changed, 9 insertions, 9 deletions
diff --git a/src/self_test.cpp b/src/self_test.cpp
index aedfb61..858a475 100644
--- a/src/self_test.cpp
+++ b/src/self_test.cpp
@@ -99,26 +99,26 @@ int main( int argc, char** argv )
else std::cout << "All results are identical (as they should be)" << std::endl;
}
- std::cout << "Comparing algorithms using full_pivot_column representation ..." << std::endl;
+ std::cout << "Comparing algorithms using BitTree representation ..." << std::endl;
{
- std::cout << "Running Twist - Full ..." << std::endl;
+ std::cout << "Running Twist - BitTree ..." << std::endl;
phat::persistence_pairs twist_pairs;
- phat::boundary_matrix< Full > twist_boundary_matrix = boundary_matrix;
+ phat::boundary_matrix< BitTree > twist_boundary_matrix = boundary_matrix;
phat::compute_persistence_pairs< phat::twist_reduction >( twist_pairs, twist_boundary_matrix );
- std::cout << "Running Standard - Full ..." << std::endl;
+ std::cout << "Running Standard - BitTree ..." << std::endl;
phat::persistence_pairs std_pairs;
- phat::boundary_matrix< Full > std_boundary_matrix = boundary_matrix;
+ phat::boundary_matrix< BitTree > std_boundary_matrix = boundary_matrix;
phat::compute_persistence_pairs< phat::standard_reduction >( std_pairs, std_boundary_matrix );
- std::cout << "Running Chunk - Full ..." << std::endl;
+ std::cout << "Running Chunk - BitTree ..." << std::endl;
phat::persistence_pairs chunk_pairs;
- phat::boundary_matrix< Full > chunk_boundary_matrix = boundary_matrix;
+ phat::boundary_matrix< BitTree > chunk_boundary_matrix = boundary_matrix;
phat::compute_persistence_pairs< phat::chunk_reduction >( chunk_pairs, chunk_boundary_matrix );
- std::cout << "Running Row - Full ..." << std::endl;
+ std::cout << "Running Row - BitTree ..." << std::endl;
phat::persistence_pairs row_pairs;
- phat::boundary_matrix< Full > row_boundary_matrix = boundary_matrix;
+ phat::boundary_matrix< BitTree > row_boundary_matrix = boundary_matrix;
phat::compute_persistence_pairs< phat::row_reduction >( row_pairs, row_boundary_matrix );
if( twist_pairs != std_pairs ) {