...

[FrontAlgorithms.git] / lib / fpa / Base / Algorithm.hxx

diff --git a/lib/fpa/Base/Algorithm.hxx b/lib/fpa/Base/Algorithm.hxx
index 5629af77c9436373f3ec5512ea0d6b0f89e0a0f8..35307874ab8a43c732169bb008612b13994ff10e 100644 (file)
--- a/lib/fpa/Base/Algorithm.hxx
+++ b/lib/fpa/Base/Algorithm.hxx
@@ -21,46 +21,6 @@ fpa::Base::Algorithm< V, C, R, S, VC, B >::_TNode::
 {
 }
 
-// -------------------------------------------------------------------------
-template< class V, class C, class R, class S, class VC, class B >
-typename fpa::Base::Algorithm< V, C, R, S, VC, B >::
-TMinimumSpanningTree* fpa::Base::Algorithm< V, C, R, S, VC, B >::
-GetMinimumSpanningTree( )
-{
-  return(
-    dynamic_cast< TMinimumSpanningTree* >(
-      this->itk::ProcessObject::GetOutput(
-        this->m_MinimumSpanningTreeIndex
-        )
-      )
-    );
-}
-
-// -------------------------------------------------------------------------
-template< class V, class C, class R, class S, class VC, class B >
-const typename fpa::Base::Algorithm< V, C, R, S, VC, B >::
-TMinimumSpanningTree* fpa::Base::Algorithm< V, C, R, S, VC, B >::
-GetMinimumSpanningTree( ) const
-{
-  return(
-    dynamic_cast< const TMinimumSpanningTree* >(
-      this->itk::ProcessObject::GetOutput(
-        this->m_MinimumSpanningTreeIndex
-        )
-      )
-    );
-}
-
-// -------------------------------------------------------------------------
-template< class V, class C, class R, class S, class VC, class B >
-void fpa::Base::Algorithm< V, C, R, S, VC, B >::
-GraftMinimumSpanningTree( itk::DataObject* obj )
-{
-  TMinimumSpanningTree* mst = dynamic_cast< TMinimumSpanningTree* >( obj );
-  if( mst != NULL )
-    this->GraftNthOutput( this->m_MinimumSpanningTreeIndex, mst );
-}
-
 // -------------------------------------------------------------------------
 template< class V, class C, class R, class S, class VC, class B >
 void fpa::Base::Algorithm< V, C, R, S, VC, B >::
@@ -129,11 +89,6 @@ Algorithm( )
     m_ThrowEvents( false ),
     m_StopAtOneFront( false )
 {
-  this->m_MinimumSpanningTreeIndex = this->GetNumberOfRequiredOutputs( );
-  this->SetNumberOfRequiredOutputs( this->m_MinimumSpanningTreeIndex + 1 );
-  this->itk::ProcessObject::SetNthOutput(
-    this->m_MinimumSpanningTreeIndex, TMinimumSpanningTree::New( )
-    );
 }
 
 // -------------------------------------------------------------------------
@@ -354,6 +309,14 @@ _Node( const TVertex& v )
   return( vIt->second );
 }
 
+// -------------------------------------------------------------------------
+template< class V, class C, class R, class S, class VC, class B >
+void fpa::Base::Algorithm< V, C, R, S, VC, B >::
+_SetResult( const TVertex& v, const _TNode& n )
+{
+  // Do nothing at this hierarchy level
+}
+
 // -------------------------------------------------------------------------
 template< class V, class C, class R, class S, class VC, class B >
 const typename fpa::Base::Algorithm< V, C, R, S, VC, B >::