EGraph.h

Go to the documentation of this file.

// ----------------------------------------------------------------------------
//
// $Id$
//
// Copyright 2008, 2009, 2010, 2011, 2012  Antonio Franchi and Paolo Stegagno
//
// This file is part of MIP.
//
// MIP 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 3 of the License, or
// (at your option) any later version.
//
// MIP 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 MIP. If not, see <http://www.gnu.org/licenses/>.
//
// Contact info: antonio.franchi@tuebingen.mpg.de stegagno@diag.uniroma1.it
//
// ----------------------------------------------------------------------------


#ifndef __E_GRAPH_H__
#define __E_GRAPH_H__

#include <boost/config.hpp>
#include <iostream>                         // for std::cout
#include <utility>                          // for std::pair
#include <algorithm>                        // for std::for_each
#include <boost/utility.hpp>                // for boost::tie
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graphviz.hpp>


using namespace std;
using namespace boost;


struct EVertex{

};

struct EEdge{

};


typedef boost::adjacency_list< boost::listS , boost::vecS , boost::undirectedS, EVertex, EEdge> BoostEGraph;


class EMap{

 public:
  void integrate(){}; 
  void findNewEdges(){}; 
  void plan(){}; 
  
};


class ERobot{

 public:
};


class ERobots : public std::vector<ERobot>{

 public:
  void perceive(){}; 
  void move(){}; 
};


class EGraph : public BoostEGraph{

 public:

  void initialize(){}; 
  void augment(){}; 

};


#endif