-#ifndef __FPA__BASE__DIJKSTRA__HXX__
-#define __FPA__BASE__DIJKSTRA__HXX__
+#ifndef __fpa__Base__Dijkstra__hxx__
+#define __fpa__Base__Dijkstra__hxx__
#include <algorithm>
+#include <limits>
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-fpa::Base::Dijkstra< V, C, R, B >::
-Dijkstra( )
- : Superclass( )
+template< class _TSuperclass, class _TMST >
+_TMST* fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+GetMinimumSpanningTree( )
{
+ return(
+ dynamic_cast< _TMST* >(
+ this->itk::ProcessObject::GetOutput( this->m_MSTIndex )
+ )
+ );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-fpa::Base::Dijkstra< V, C, R, B >::
-~Dijkstra( )
+template< class _TSuperclass, class _TMST >
+const _TMST* fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+GetMinimumSpanningTree( ) const
{
+ return(
+ dynamic_cast< const _TMST* >(
+ this->itk::ProcessObject::GetOutput( this->m_MSTIndex )
+ )
+ );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-bool fpa::Base::Dijkstra< V, C, R, B >::
-_ComputeNeighborResult(
- TResult& result, const TVertex& neighbor, const TVertex& parent
- ) const
+template< class _TSuperclass, class _TMST >
+fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+Dijkstra( )
+ : Superclass( )
{
- result = this->_Cost( neighbor, parent );
- result *= TResult( this->_Distance( neighbor, parent ) );
-
- _TNode pn = this->_Node( parent );
- if( pn.Label == Self::AliveLabel )
- result += pn.Result;
-
- return( true );
+ this->m_InitResult = TOutput( 0 );
+ this->m_MSTIndex = this->GetNumberOfRequiredOutputs( );
+ this->SetNumberOfRequiredOutputs( this->m_MSTIndex + 1 );
+ this->itk::ProcessObject::SetNthOutput( this->m_MSTIndex, _TMST::New( ) );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-bool fpa::Base::Dijkstra< V, C, R, B >::
-_IsQueueEmpty( ) const
+template< class _TSuperclass, class _TMST >
+fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+~Dijkstra( )
{
- return( this->m_Queue.empty( ) );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-void fpa::Base::Dijkstra< V, C, R, B >::
-_QueuePush( const _TNode& n )
+template< class _TSuperclass, class _TMST >
+void fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+_AfterGenerateData( )
{
- this->m_Queue.push_back( n );
- std::push_heap(
- this->m_Queue.begin( ), this->m_Queue.end( ), Self::m_NodeCompare
- );
+ this->Superclass::_AfterGenerateData( );
+
+ auto mst = this->GetMinimumSpanningTree( );
+ mst->ClearSeeds( );
+ for( auto s = this->m_Seeds.begin( ); s != this->m_Seeds.end( ); ++s )
+ mst->AddSeed( s->Vertex );
+ mst->SetCollisions( this->m_Collisions );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-typename fpa::Base::Dijkstra< V, C, R, B >::
-_TNode fpa::Base::Dijkstra< V, C, R, B >::
-_QueuePop( )
+template< class _TSuperclass, class _TMST >
+void fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+_UpdateResult( const _TQueueNode& n )
{
- _TNode n = this->m_Queue.front( );
- std::pop_heap(
- this->m_Queue.begin( ), this->m_Queue.end( ), Self::m_NodeCompare
- );
- this->m_Queue.pop_back( );
- return( n );
+ this->Superclass::_UpdateResult( n );
+ this->GetMinimumSpanningTree( )->SetParent( n.Vertex, n.Parent );
}
// -------------------------------------------------------------------------
-template< class V, class C, class R, class B >
-void fpa::Base::Dijkstra< V, C, R, B >::
-_QueueClear( )
+template< class _TSuperclass, class _TMST >
+bool fpa::Base::Dijkstra< _TSuperclass, _TMST >::
+_UpdateValue( _TQueueNode& v, const _TQueueNode& p )
{
- this->m_Queue.clear( );
+ v.Result = this->_GetInputValue( p.Vertex, v.Vertex );
+ if( v.Result >= TOutput( 0 ) )
+ {
+ v.Result += p.Result;
+ return( true );
+ }
+ else
+ {
+ v.Result = this->m_InitResult;
+ return( false );
+
+ } // fi
}
-#endif // __FPA__BASE__DIJKSTRA__HXX__
+#endif // __fpa__Base__Dijkstra__hxx__
// eof - $RCSfile$