NodeLimitAbstraction.h

Go to the documentation of this file.

/*
 *  NodeLimitAbstraction.h
 *  hog
 *
 *  Created by Nathan Sturtevant on 3/24/07.
 *  Copyright 2007 __MyCompanyName__. All rights reserved.
 *
 * This file is part of HOG.
 *
 * HOG is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 * 
 * HOG is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with HOG; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 *
 */
 
#include "MapAbstraction.h"
 
#ifndef NodeLimitABSTRACTION_H
#define NodeLimitABSTRACTION_H
 
class NodeLimitAbstraction : public MapAbstraction {
public:
        NodeLimitAbstraction(Map *, int nodeLimit);
        ~NodeLimitAbstraction();
        MapAbstraction *Clone(Map *_m) { return new NodeLimitAbstraction(_m, nodeLimit); }
        
        virtual bool Pathable(node *from, node *to);
        
        // utility functions
        virtual void VerifyHierarchy();
        
        // hierarchical modifications
        virtual void RemoveNode(node *n);
  virtual void RemoveEdge(edge *e, unsigned int absLevel);
        virtual void AddNode(node *n);
        virtual void AddEdge(edge *e, unsigned int absLevel);
  virtual void RepairAbstraction();     
private:
        void buildAbstraction();
        void buildNodeIntoParent(node *n, node *parent);
        void abstractionBFS(node *which, node *parent, int depth);
        
        void addEdges(Graph *g);
        void addNodes(Graph *g);
        
        int nodeLimit;
};
 
#endif