E* Interpolated Graph Replanner Wed Dec 12 18:55:40 2007
00001 /* 00002 * Copyright (C) 2006 Roland Philippsen <roland dot philippsen at gmx net> 00003 * 00004 * This program is free software; you can redistribute it and/or modify 00005 * it under the terms of the GNU General Public License as published by 00006 * the Free Software Foundation; either version 2 of the License, or 00007 * (at your option) any later version. 00008 * 00009 * This program is distributed in the hope that it will be useful, 00010 * but WITHOUT ANY WARRANTY; without even the implied warranty of 00011 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 00012 * GNU General Public License for more details. 00013 * 00014 * You should have received a copy of the GNU General Public License 00015 * along with this program; if not, write to the Free Software 00016 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 00017 * USA 00018 */ 00019 00020 00021 #ifndef ESTAR_UPWIND_HPP 00022 #define ESTAR_UPWIND_HPP 00023 00024 00025 #include <estar/base.hpp> 00026 #include <set> 00027 #include <map> 00028 00029 00030 namespace estar { 00031 00032 00034 class Upwind { 00035 public: 00036 typedef std::set<vertex_t> set_t; 00037 typedef std::map<vertex_t, set_t > map_t; 00038 00039 bool HaveEdge(vertex_t from, vertex_t to) const; 00040 void AddEdge(vertex_t from, vertex_t to); 00041 00047 void RemoveEdge(vertex_t from, vertex_t to); 00048 00050 void RemoveIncoming(vertex_t to); 00051 00052 const map_t & GetMap() const { return m_from_to; } 00053 const set_t & GetDownwind(vertex_t from) const; 00054 00055 private: 00056 mutable map_t m_from_to; 00057 mutable map_t m_to_from; 00058 }; 00059 00060 } // namespace estar 00061 00062 #endif // ESTAR_UPWIND_HPP