Edge.h

Go to the documentation of this file.

 
#pragma once
 
#include <node.h>
#include <vector>
 
namespace HF {
    namespace SpatialStructures {
        enum STEP {
            NOT_CONNECTED = 0, 
            NONE = 1,        
            UP = 2,         
            DOWN = 3,       
            OVER = 4        
        };
 
 
        struct Edge {
            Node child;         
            STEP step_type;     
            float score;        
 
 
            Edge(const Node& Child, float Score = 0, STEP Step_Type = NONE);
 
            Edge() {};
        };
 
 
        struct IntEdge {
            int child;      
            float weight;   
 
 
            inline bool operator==(const IntEdge& IE2) const {
                return ( (this->child == IE2.child && abs(this->weight - IE2.weight) < 0.0001 ) // \todo resolve this constant for edge tolerance?
                );
            }
 
            inline bool operator!=(const IntEdge& IE2) const { return !(this->operator==(IE2)); }
        };
 
 
        struct EdgeSet {
            int parent;                     
            std::vector<IntEdge> children;  
 
            EdgeSet() { parent = -1; };
 
 
            inline EdgeSet(int parent, const std::vector<IntEdge>& edges) {
                this->AddEdges(edges);
                this->parent = parent;
            }
 
            inline int size() const { return children.size(); }
 
            inline void AddEdges(const std::vector<IntEdge> & edges) {
                // If we have no edges, just overwrite our existing array
                if (children.size() == 0)
                    children = edges;
                // Otherwise resize and copy in
                else {
                    children.resize(children.size() + edges.size());
                    std::copy(edges.begin(), edges.end(), children.begin() + children.size());
                }
            }
 
            inline bool operator==(const EdgeSet & ES2) const {
                if (this->parent != ES2.parent) return false;
                if (this->children.size() != ES2.children.size()) return false;
                
                for (int i = 0; i < this->children.size(); i++)
                    if (this->children[i] != ES2.children[i])
                        return false;
                return true;
            }
        };
    }
}