LArGraph.h

Go to the documentation of this file.

#ifndef LAR_GRAPH_H
#define LAR_GRAPH_H 1

#include "Objects/Cluster.h"

#include <Eigen/Dense>

namespace lar_content
{

class LArGraph
{
public:
    class Edge
    {
    public:
        Edge(const pandora::CaloHit *const pVertex0, const pandora::CaloHit *const pVertex1);

        float LengthSquared() const;

        inline bool operator==(const Edge &other) const
        {
            return (this->m_v0 == other.m_v0 && this->m_v1 == other.m_v1) || (this->m_v0 == other.m_v1 && this->m_v1 == other.m_v0);
        };

        const pandora::CaloHit *const m_v0; 
        const pandora::CaloHit *const m_v1; 
    };
    typedef std::vector<const Edge *> EdgeVector;

private:
    typedef std::map<const pandora::CaloHit *, EdgeVector> HitEdgeMap;
    typedef std::map<const pandora::CaloHit *, pandora::CaloHitList> HitConnectionsMap;
    typedef std::map<const pandora::CaloHit *, bool> HitUseMap;

public:
    LArGraph(const bool fullyConnect = true, const int nSourceEdges = 2, const float maxSecondaryCosine = 0.996f, const float maxSecondaryDistance = 3.f);

    ~LArGraph();

    const EdgeVector &GetEdges() const;

    void MakeGraph(const pandora::CaloHitList &caloHitList);

    void Walk(const pandora::CaloHit *const pCaloHit, const HitEdgeMap &hitToEdgesMap, pandora::CaloHitList &graph, HitUseMap &connectedHits) const;

private:
    void IdentifyDisconnectedRegions(const HitEdgeMap &hitToEdgesMap, HitConnectionsMap &graphs) const;

    void ConnectRegions(const HitConnectionsMap &graphs, HitEdgeMap &hitToEdgesMap);

    void Vectorize(const pandora::CaloHitList &caloHitList, Eigen::MatrixXf &hitMatrix) const;

    EdgeVector m_edges;           
    bool m_fullyConnect;          
    int m_nSourceEdges;           
    float m_maxSecondaryCosine;   
    float m_maxSecondaryDistance; 
};

} // namespace lar_content

#endif // #ifndef LAR_GRAPH_H