- auto branches = w_filter->GetOutputData( "Skeleton" )->GetITK< TFASkeleton >( );
- auto& endpoints = w_filter->GetOutputData( "EndPoints" )->GetITK< TVerticesFA >( )->Get( );
- auto& bifurcations = w_filter->GetOutputData( "Bifurcations" )->GetITK< TVerticesFA >( )->Get( );
- auto image = ws.GetFilter( "reader" )->GetOutputData( "Output" )->GetITK< itk::ImageBase< 3 > >( );
- auto distance_map = ws.GetFilter( "dmap" )->GetOutputData( "Output" )->GetITK< itk::Image< float, 3 > >( );
-
- /*
- TBranchesFA* branches = filter->GetBranches( );
- TMst* mst = filter->GetMinimumSpanningTree();
- */
- int leoTreeWeigth = endpoints.size()+bifurcations.size()+1;
- std::cout<< "Creates FA Tree with : "<<leoTreeWeigth << " nodes "<<std::endl;
-
- auto seed0 = ws.GetFilter( "seed" )->GetOutputData( "Output" )->GetITK< TVerticesFA >( )->Get( )[ 0 ];
- //Fill vertex map. Gotta do it with bifurcations, endpoints and the root.
- //Do the root
- vertexMap[ seed0 ] = FAVertexToNode( seed0, image );
- //Do Endpoints
- auto eIt = endpoints.begin();
- for( ; eIt != endpoints.end(); ++eIt )
+ auto distance_map =
+ ws.GetFilter( "dmap" )->GetOutputData( "Output" )->
+ GetITK< itk::Image< float, 3 > >( );
+ auto branches =
+ w_filter->GetOutputData( "Skeleton" )->GetITK< TFASkeleton >( );
+ auto sIt = branches->Get( ).begin( );
+ for( ; sIt!=branches->Get( ).end( ); ++sIt )