mitkConnectomicsShortestPathHistogram.h

Go to the documentation of this file.

/*===================================================================

The Medical Imaging Interaction Toolkit (MITK)

Copyright (c) German Cancer Research Center,
Division of Medical and Biological Informatics.
All rights reserved.

This software is distributed WITHOUT ANY WARRANTY; without
even the implied warranty of MERCHANTABILITY or FITNESS FOR
A PARTICULAR PURPOSE.

See LICENSE.txt or http://www.mitk.org for details.

===================================================================*/


#ifndef _MITK_ConnectomicsShortestPathHistogram_H
#define _MITK_ConnectomicsShortestPathHistogram_H

#include<mitkConnectomicsHistogramBase.h>

#include <MitkConnectomicsExports.h>

namespace mitk {

  class MITKCONNECTOMICS_EXPORT ConnectomicsShortestPathHistogram : public mitk::ConnectomicsHistogramBase
  {

  public:

    enum ShortestPathCalculationMode
    {
      UnweightedUndirectedMode,
      WeightedUndirectedMode
    };

    ConnectomicsShortestPathHistogram();
    virtual ~ConnectomicsShortestPathHistogram();

    void SetShortestPathCalculationMode( const ShortestPathCalculationMode & );

    ShortestPathCalculationMode GetShortestPathCalculationMode();

    double GetEfficiency();


  protected:

    /* Typedefs */
    typedef mitk::ConnectomicsNetwork::NetworkType NetworkType;
    typedef boost::graph_traits< NetworkType >::vertex_descriptor DescriptorType;
    typedef boost::graph_traits< NetworkType >::vertex_iterator IteratorType;

    virtual void ComputeFromConnectomicsNetwork( ConnectomicsNetwork* source ) override;

    void CalculateUnweightedUndirectedShortestPaths( NetworkType* boostGraph );

    void CalculateWeightedUndirectedShortestPaths( NetworkType* boostGraph );

    void ConvertDistanceMapToHistogram();

    ShortestPathCalculationMode m_Mode;

    std::vector< std::vector< int > > m_DistanceMatrix;

    bool m_EverythingConnected;
  };

}

#endif /* _MITK_ConnectomicsShortestPathHistogram_H */