...

[FrontAlgorithms.git] / lib / fpa / Image / ExtractEndPointsAndBifurcationsFromMinimumSpanningTree.hxx

diff --git a/lib/fpa/Image/ExtractEndPointsAndBifurcationsFromMinimumSpanningTree.hxx b/lib/fpa/Image/ExtractEndPointsAndBifurcationsFromMinimumSpanningTree.hxx
index 3e7a32bcac72602428bb2d21565b9cd2a20ee4f9..789d392f6a65634e186ca372921404559c31bc6b 100644 (file)
--- a/lib/fpa/Image/ExtractEndPointsAndBifurcationsFromMinimumSpanningTree.hxx
+++ b/lib/fpa/Image/ExtractEndPointsAndBifurcationsFromMinimumSpanningTree.hxx
@@ -121,7 +121,7 @@ GenerateData( )
   sk->SetMinimumSpanningTree( this->GetMinimumSpanningTree( ) );
   auto bIt = this->m_Branches.begin( );
   for( ; bIt != this->m_Branches.end( ); ++bIt )
-    sk->AddBranch( bIt->first, bIt->second );
+    sk->AddBranch( bIt->second, bIt->first );
 }
 
 // -------------------------------------------------------------------------
@@ -188,9 +188,11 @@ _MarkSphere(
   {
     typename _TImage::PointType pnt;
     this->m_MarkImage->TransformIndexToPhysicalPoint( spIt.GetIndex( ), pnt );
-    if( double( pnt.EuclideanDistanceTo( c ) ) <= rr || all )
+    /*
+      if( double( pnt.EuclideanDistanceTo( c ) ) <= rr || all )
       if( spIt.Get( ) == 0 )
-        spIt.Set( l );
+    */
+    spIt.Set( l );
 
   } // rof
 }