...

[FrontAlgorithms.git] / lib / fpa / Base / Dijkstra.h

diff --git a/lib/fpa/Base/Dijkstra.h b/lib/fpa/Base/Dijkstra.h
index d4f27cdf7dce2c8065997323fb2f394a4c8adb64..08c704e83b9b7d019eafd6904be1b68158d8e771 100644 (file)
--- a/lib/fpa/Base/Dijkstra.h
+++ b/lib/fpa/Base/Dijkstra.h
@@ -1,10 +1,7 @@
-#ifndef __FPA__BASE__DIJKSTRA__H__
-#define __FPA__BASE__DIJKSTRA__H__
+#ifndef __fpa__Base__Dijkstra__h__
+#define __fpa__Base__Dijkstra__h__
 
-#include <vector>
-#include <itkFunctionBase.h>
-#include <fpa/Base/Algorithm.h>
-#include <fpa/Base/MinimumSpanningTree.h>
+#include <fpa/Base/PriorityQueueAlgorithm.h>
 
 namespace fpa
 {
@@ -12,80 +9,48 @@ namespace fpa
   {
     /**
      */
-    template< class _TSuperclass >
+    template< class _TSuperclass, class _TMST >
     class Dijkstra
-      : public _TSuperclass
+      : public fpa::Base::PriorityQueueAlgorithm< _TSuperclass >
     {
     public:
-      typedef Dijkstra                        Self;
-      typedef _TSuperclass                    Superclass;
-      typedef itk::SmartPointer< Self >       Pointer;
-      typedef itk::SmartPointer< const Self > ConstPointer;
-
-      // Template arguments
-      typedef typename Superclass::TVertex        TVertex;
-      typedef typename Superclass::TScalar        TScalar;
-      typedef typename Superclass::TFilter        TFilter;
-      typedef typename Superclass::TVertexCompare TVertexCompare;
-      typedef typename Superclass::TFrontId       TFrontId;
-      typedef typename Superclass::TCollision     TCollision;
-      typedef typename Superclass::TCollisionsRow TCollisionsRow;
-      typedef typename Superclass::TCollisions    TCollisions;
-      typedef typename Superclass::TNodeLabel     TNodeLabel;
-      typedef typename Superclass::TNode          TNode;
-      typedef typename Superclass::TNodes         TNodes;
-      typedef typename Superclass::TVertices      TVertices;
-
-      typedef itk::FunctionBase< TScalar, TScalar > TCostConversionFunction;
-
-      typedef
-      fpa::Base::MinimumSpanningTree< TVertex, TScalar, TVertexCompare >
-      TMinimumSpanningTree;
-
-      struct TDijkstraCmp
-      {
-        bool operator()( const TNode& a, const TNode& b )
-          { return( b.Result < a.Result ); }
-      };
-      static const TDijkstraCmp DijkstraCmp;
+      typedef Dijkstra                                          Self;
+      typedef fpa::Base::PriorityQueueAlgorithm< _TSuperclass > Superclass;
+      typedef itk::SmartPointer< Self >                         Pointer;
+      typedef itk::SmartPointer< const Self >                   ConstPointer;
+
+      typedef _TMST TMST;
+      typedef typename Superclass::TOutput TOutput;
+      typedef typename Superclass::TVertex TVertex;
+
+    protected:
+      typedef typename Superclass::_TQueueNode _TQueueNode;
 
     public:
       itkTypeMacro( Dijkstra, Algorithm );
 
-      itkGetObjectMacro( CostConversionFunction, TCostConversionFunction );
-      itkSetObjectMacro( CostConversionFunction, TCostConversionFunction );
-
     public:
-      TMinimumSpanningTree* GetMinimumSpanningTree( );
-      const TMinimumSpanningTree* GetMinimumSpanningTree( ) const;
-      void GraftMinimumSpanningTree( itk::DataObject* obj );
+      _TMST* GetMinimumSpanningTree( );
+      const _TMST* GetMinimumSpanningTree( ) const;
 
     protected:
-      // Methods to extend itk-based architecture
       Dijkstra( );
       virtual ~Dijkstra( );
 
-      // Front propagation methods to be overloaded
-      virtual void _AfterGenerateData( ) fpa_OVERRIDE;
-      virtual void _Visit( const TNode& n ) fpa_OVERRIDE;
-      virtual bool _Result( TNode& node, const TNode& parent ) fpa_OVERRIDE;
-      virtual void  _QueueClear( ) fpa_OVERRIDE;
-      virtual void  _QueuePush( const TNode& node ) fpa_OVERRIDE;
-      virtual TNode _QueuePop( ) fpa_OVERRIDE;
-      virtual bool  _IsQueueEmpty( ) const fpa_OVERRIDE;
+      virtual void _AfterGenerateData( ) override;
 
-      // Dijkstra methods to be overloaded
-      virtual TScalar _Cost( const TVertex& a, const TVertex& b ) const = 0;
+      virtual void _UpdateResult( const _TQueueNode& n ) override;
+      virtual bool _UpdateValue(
+        _TQueueNode& v, const _TQueueNode& p
+        ) override;
 
     private:
-      // Purposely not implemented
+      // Purposely not defined
       Dijkstra( const Self& other );
       Self& operator=( const Self& other );
 
     protected:
-      unsigned int m_MSTIdx;
-      std::vector< TNode > m_Queue;
-      typename TCostConversionFunction::Pointer m_CostConversionFunction;
+      unsigned long m_MSTIndex;
     };
 
   } // ecapseman
@@ -94,8 +59,8 @@ namespace fpa
 
 #ifndef ITK_MANUAL_INSTANTIATION
 #  include <fpa/Base/Dijkstra.hxx>
-#endif
+#endif // ITK_MANUAL_INSTANTIATION
 
-#endif // __FPA__BASE__DIJKSTRA__H__
+#endif // __fpa__Base__Dijkstra__h__
 
 // eof - $RCSfile$