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 <vector>
#include <map>
#include <utility>
#include <boost/concept_check.hpp>
#include <boost/pending/queue.hpp>
#include <boost/property_map.hpp>
#include <boost/ref.hpp>
#include <boost/utility.hpp>
#include <boost/preprocessor/comparison/less.hpp>
#include <boost/type_traits/remove_const.hpp>
#include <boost/type_traits/remove_reference.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/graph/properties.hpp>
#include <boost/graph/visitors.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <msmazes/core/graph/in_edges.hpp>
#include <msmazes/core/graph/keywords.hpp>
Go to the source code of this file.
Namespaces | |
| namespace | msmazes |
| namespace | msmazes::_removeCrossEdges |
Classes | |
| class | msmazes::DefaultCrossEdgeRemovalIntruder |
The type of the default intruder passed to the msmazes::removeCrossEdges() function template. More... | |
Functions | |
| template<typename PathIterator, typename InputGraph, typename PredecessorMap, typename VertexIndexMap, typename VertexColorMap, typename VertexRankMap, typename Buffer, typename CrossEdgeRemovalIntruder> | |
| void | removeCrossEdges (PathIterator path_begin, PathIterator path_end, InputGraph &g, PredecessorMap predecessor_map, VertexIndexMap index_map, VertexColorMap color_map, VertexRankMap rank_map, Buffer &Q, CrossEdgeRemovalIntruder &intruder) |
| Converts the specified digraph to a maze with the specified solution path, using any specified utility maps. | |
| template<typename Params> | |
| void | removeCrossEdges_with_named_params (Params &p) |
Packed-argument version of removeCrossEdges(). | |
Multi-State Mazes in C++ is hosted by . Use the Table of Contents for navigation.