GraphNode.h

Go to the documentation of this file.

//
//  VBOVertex.h
//  GlobeEngine
//
//  Created by Mathias Thöny on 27.12.11.
//  Copyright (c) 2011 University of Zurich. All rights reserved.
//

#ifndef GlobeEngine_GraphNode_h
#define GlobeEngine_GraphNode_h
#include "VBOVertex.h"
#include "OpenGL_Includes.h"
#include <iostream>

namespace geGraph {
    /*
     * Graph node
     */
    template <class T> class GraphNode
    {
    public:
        GraphNode() { }
        GraphNode(T _uid): uid(_uid){
            this->marked = false;
        }
        
        T getUID() {
            return this->uid;
        }
        
        void addEdge(T _edge) {
            neighbors.push_back(_edge);
        }
        
        std::vector< T > getNeighbors() {
            return neighbors;
        }
        
        unsigned int getNeighborCount() {
            return this->neighbors.size();
        }
        
        bool isCrossing() {
            if (neighbors.size() > 2)
                return true;
            return false;
        }
        
        bool isConnector() {
            if (neighbors.size() == 2)
                return true;
            return false;
        }
        
        T getOppositeEdge(T _edgeID) {
            if (this->isConnector()) {
                if (_edgeID != neighbors[0] && _edgeID != neighbors[1]) {
                    std::cout << "cannot find this edge connected to graph node" << std::endl;
                }
                if(_edgeID == neighbors[0]) {
                    return neighbors[1];
                }else{
                    return neighbors[0];
                }
            }else{
                std::cout << "node is not a connector" << std::endl;
            }
            return std::numeric_limits<T>::max();
        }
        
        bool isEndpoint() {
            if (neighbors.size() == 1)
                return true;
            return false;
        }
        
        bool hasNeighbors() {
            if (neighbors.size() == 0)
                return false;
            return true;
        }
        
        bool isIDaNeighborEdge(T _edgeID) {
            for (int i = 0;i < this->neighbors.size();i++) {
                if(this->neighbors[i] == _edgeID){
                    return true;
                }
            }
            return false;
        }
        
        void mark(){
            this->marked = true;
        }
        
        void unmark(){
            this->marked = false;
        }
        
        bool isMarked(){
            return this->marked;
        }
        
        friend std::ostream& operator<< (std::ostream &out, const GraphNode< T > &graphNode) {
            out << "uid " << graphNode.uid << " has " << graphNode.neighbors.size() << " neighbors: ";
            for (int i = 0;i < graphNode.neighbors.size();i++) {
                out << graphNode.neighbors[i] << " ";
            }
            return out;
        }
        
    private:
        bool marked;
        T uid;
        std::vector< T > neighbors;
    };
    
    //typedef GraphNode<unsigned int> GraphNodeui;
}
#endif