détails

git-svn-id: svn+ssh://scm.gforge.inria.fr/svnroot/gudhi/branches/bottleneckDistance@1209 636b058d-ea47-450e-bf9e-a15bfbe3eedb

Former-commit-id: 68dcb3d217126ee638284d9b3951d1fa20be5904

1 files changed, 3 insertions, 3 deletions

diff --git a/src/Bipartite_graphs_matching/example/basic.cpp b/src/Bipartite_graphs_matching/example/basic.cpp
index ad299225..09530f9a 100644
--- a/src/Bipartite_graphs_matching/example/basic.cpp
+++ b/src/Bipartite_graphs_matching/example/basic.cpp
@@ -28,7 +28,7 @@
 
 using namespace Gudhi::bipartite_graph_matching;
 
-/*
+
 double upper_bound = 400.; // any real >0
 
 int main(){
@@ -63,9 +63,9 @@ int main(){
     }
     objetfichier.close();
 }
-*/
 
 
+/*
 int main() {
     std::vector< std::pair<double,double> > v1, v2;
 
@@ -81,4 +81,4 @@ int main() {
 
     std::cout << "Bottleneck distance = " << b << std::endl;
 
-}
+}*/