} // rof
} // rof
+ this->m_Seeds.resize( N );
this->Modified( );
}
// -------------------------------------------------------------------------
template< class _TVertex, class _Superclass >
void fpa::DataStructures::MinimumSpanningTree< _TVertex, _Superclass >::
-AddSeed( const _TVertex& seed )
+AddSeed( const _TVertex& seed, unsigned long fId )
{
- this->m_Seeds.push_back( seed );
+ this->m_Seeds[ fId - 1 ] = seed;
this->Modified( );
}
template< class _TVertex, class _Superclass >
typename fpa::DataStructures::MinimumSpanningTree< _TVertex, _Superclass >::
TVertices fpa::DataStructures::MinimumSpanningTree< _TVertex, _Superclass >::
-GetPath( const _TVertex& a ) const
+GetAxis( const _TVertex& a ) const
{
TVertices vertices;
_TVertex it = a;
template< class _TVertex, class _Superclass >
typename fpa::DataStructures::MinimumSpanningTree< _TVertex, _Superclass >::
TVertices fpa::DataStructures::MinimumSpanningTree< _TVertex, _Superclass >::
-GetPath( const _TVertex& a, const _TVertex& b ) const
+GetAxis( const _TVertex& a, const _TVertex& b ) const
{
static const unsigned long _inf =
std::numeric_limits< unsigned long >::max( );
TVertices vertices;
- TVertices pa = this->GetPath( a );
- TVertices pb = this->GetPath( b );
+ TVertices pa = this->GetAxis( a );
+ TVertices pb = this->GetAxis( b );
if( pa.size( ) > 0 && pb.size( ) > 0 )
{
// Find front identifiers
if( N > 0 )
{
// First path: from start vertex to first collision
- vertices = this->GetPath(
+ vertices = this->GetAxis(
a, this->m_Collisions[ fpath[ 0 ] ][ fpath[ 1 ] ].first
);
for( unsigned int i = 1; i < N - 1; ++i )
{
TVertices ipath =
- this->GetPath(
+ this->GetAxis(
this->m_Collisions[ fpath[ i - 1 ] ][ fpath[ i ] ].first,
this->m_Collisions[ fpath[ i + 1 ] ][ fpath[ i ] ].first
);
// Final path: from last collision to end point
TVertices lpath =
- this->GetPath(
+ this->GetAxis(
this->m_Collisions[ fpath[ N - 1 ] ][ fpath[ N - 2 ] ].first, b
);
for( long id = 0; id < lpath.size( ); ++id )