...

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

diff --git a/lib/fpa/Base/DijkstraBase.hxx b/lib/fpa/Base/DijkstraBase.hxx
index a78554b82107e7d746954a8132dc86c77b64e317..6f4937e82b9f5a5f67bc1ad1395ec5277d67282e 100644 (file)
--- a/lib/fpa/Base/DijkstraBase.hxx
+++ b/lib/fpa/Base/DijkstraBase.hxx
@@ -50,18 +50,6 @@ _ComputeOutputValue( const TNode& n )
   return( c + this->_GetOutputValue( n.Parent ) );
 }
 
-// -------------------------------------------------------------------------
-template< class _TAlgorithm >
-void fpa::Base::DijkstraBase< _TAlgorithm >::
-_QueueInit( )
-{
-  typedef typename Superclass::TSeedsInterface::TSeeds::iterator _TIt;
-
-  this->Superclass::_QueueInit( );
-  for( _TIt sIt = this->BeginSeeds( ); sIt != this->EndSeeds( ); ++sIt )
-    sIt->Value = TOutputValue( 0 );
-}
-
 // -------------------------------------------------------------------------
 template< class _TAlgorithm >
 void fpa::Base::DijkstraBase< _TAlgorithm >::
@@ -109,6 +97,16 @@ _QueueSize( ) const
   return( this->m_Queue.size( ) );
 }
 
+// -------------------------------------------------------------------------
+template< class _TAlgorithm >
+void fpa::Base::DijkstraBase< _TAlgorithm >::
+_PrepareSeeds( TNodes& nodes )
+{
+  typename TNodes::iterator nIt = nodes.begin( );
+  for( ; nIt != nodes.end( ); ++nIt )
+    nIt->Value = TOutputValue( 0 );
+}
+
 #endif // __fpa__Base__DijkstraBase__hxx__
 
 // eof - $RCSfile$