GraphWeiss.h

// (pairwise) Graph class interface;
// Written by Sergey G. Kosov in 2011 - 2014 for Project X (based on M. A. Weiss recommendations) 
#pragma once

#include "IGraphPairwise.h"


namespace DirectGraphicalModels
{
    // ================================ Graph Class ================================
    class CGraphWeiss : public IGraphPairwise
    {
    public:
        struct Node;
        
        // =============================== Edge Structure ==============================
        struct Edge {
            Node    * node1;        
            Node    * node2;        
            Mat       Pot;          
            float   * msg;          
            float   * msg_temp;     
            byte      group_id;     
            
            Edge(void) = delete;
            Edge(Node* n1, Node* n2, byte group = 0, const Mat &p = EmptyMat) : node1(n1), node2(n2), Pot(p.empty() ? Mat() : p.clone()), msg(NULL), msg_temp(NULL), group_id(group) {}
            
            ~Edge(void) {
                if (msg)        delete[] msg;       msg = NULL;
                if (msg_temp)   delete[] msg_temp;  msg_temp = NULL;
            }
            
            void msg_swap(void) {
                float *tmp = msg;
                msg = msg_temp;
                msg_temp = tmp;
            }
        };

        using vec_pEdge_t = std::vector<Edge *>;

        // =============================== Node Structure ==============================
        struct Node {
            size_t      id;     
            Mat         Pot;    
            vec_pEdge_t to;     
            vec_pEdge_t from;   

            Node(void) = delete;
            Node(size_t _id, const Mat& p = EmptyMat) : id(_id), Pot(p.empty() ? Mat() : p.clone()) {}
            ~Node() {
                for (Edge* e : to)
                    delete e;
            }
        };

        using vec_pNode_t = std::vector<Node *>;
    
    
    public:
        DllExport CGraphWeiss(byte nStates);
        DllExport virtual ~CGraphWeiss(void);
        

        DllExport void      reset(void) override;
        DllExport size_t    addNode(const Mat &pot = EmptyMat) override;
        DllExport void      setNode(size_t node, const Mat &pot) override;
        DllExport void      getNode(size_t node, Mat &pot) const override;
        DllExport void      getChildNodes(size_t node, vec_size_t &vNodes) const override;
        DllExport void      getParentNodes(size_t node, vec_size_t &vNodes) const override;
        DllExport size_t    getNumNodes(void) const override { return m_vpNodes.size(); }
        DllExport size_t    getNumEdges(void) const override;

        DllExport void      addEdge     (size_t srcNode, size_t dstNode, byte group, const Mat &pot) override;
        DllExport void      setEdge     (size_t srcNode, size_t dstNode, const Mat &pot) override;
        DllExport void      setEdges    (std::optional<byte> group, const Mat& pot) override;
        DllExport void      getEdge     (size_t srcNode, size_t dstNode, Mat &pot) const override;
        DllExport void      setEdgeGroup(size_t srcNode, size_t dstNode, byte group) override;
        DllExport byte      getEdgeGroup(size_t srcNode, size_t dstNode) const override;
        DllExport void      removeEdge  (size_t srcNode, size_t dstNode) override;
        DllExport bool      isEdgeExists(size_t srcNode, size_t dstNode) const override;


    protected:
        DllExport  Edge*            findEdge(size_t srcNode, size_t dstNode) const;

    private:
        size_t      m_IDx;          // = 0; Primary Key
        vec_pNode_t m_vpNodes;      // Nodes container
    };
}