- this->Superclass::_AfterGenerateData( );
- this->GetMinimumSpanningTree( )->SetCollisions( this->m_Collisions );
-}
-
-// -------------------------------------------------------------------------
-template< class _TSuperclass >
-void fpa::Base::Dijkstra< _TSuperclass >::
-_Visit( const TNode& n )
-{
- this->Superclass::_Visit( n );
- this->GetMinimumSpanningTree( )->SetNode(
- n.Vertex, n.Parent, n.FrontId, n.Result
- );
-}
-
-// -------------------------------------------------------------------------
-template< class _TSuperclass >
-bool fpa::Base::Dijkstra< _TSuperclass >::
-_Result( TNode& node, const TNode& parent )
-{
- node.Result = this->_Cost( node.Vertex, parent.Vertex );
- if( node.Result >= TScalar( 0 ) )
- {
- if( this->m_CostConversionFunction.IsNotNull( ) )
- node.Result = this->m_CostConversionFunction->Evaluate( node.Result );
- node.Result += parent.Result;
- return( true );
- }
- else
- return( false );
-}
-
-// -------------------------------------------------------------------------
-template< class _TSuperclass >
-void fpa::Base::Dijkstra< _TSuperclass >::
-_QueueClear( )
-{
- this->m_Queue.clear( );
-}