This file is part of Multi-State Mazes.
Multi-State Mazes 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.
Multi-State Mazes 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.
If you were not able to obtain the license through any of the above links, write to:
The Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include <boost/utility.hpp>
#include <boost/graph/graph_traits.hpp>
Go to the source code of this file.
Namespaces | |
| namespace | msmazes |
| namespace | msmazes::_detail |
Functions | |
| template<typename Graph> | |
| bool | hasInEdges (typename boost::graph_traits< Graph >::vertex_descriptor target_v, const Graph &g) |
Returns true if the graph contains any incoming edges to target_v, false otherwise. | |
| template<typename Graph> | |
| void | removeInEdges (typename boost::graph_traits< Graph >::vertex_descriptor target_v, Graph &g) |
Removes all of target_v's incoming edges from the graph. | |
Multi-State Mazes in C++ is hosted by . Use the Table of Contents for navigation.