|
||||
File indexing completed on 2025-01-18 09:42:05
0001 // Copyright 2008-2010 Gordon Woodhull 0002 // Distributed under the Boost Software License, Version 1.0. 0003 // (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) 0004 0005 #ifndef BOOST_MSM_MPL_GRAPH_ADJACENCY_LIST_GRAPH_HPP_INCLUDED 0006 #define BOOST_MSM_MPL_GRAPH_ADJACENCY_LIST_GRAPH_HPP_INCLUDED 0007 0008 // graph implementation based on an adjacency list 0009 // sequence< pair< source_vertex, sequence< pair<edge, target_vertex> > > > 0010 0011 // adjacency_list_graph labels such a sequence as manipulable by the metafunctions 0012 // in the corresponding implementation header detail/adjacency_list_graph.ipp 0013 // to produce the metadata structures needed by mpl_graph.hpp 0014 0015 // the public interface 0016 #include <boost/msm/mpl_graph/mpl_graph.hpp> 0017 0018 // the implementation 0019 #include <boost/msm/mpl_graph/detail/adjacency_list_graph.ipp> 0020 0021 namespace boost { 0022 namespace msm { 0023 namespace mpl_graph { 0024 0025 template<typename AdjacencyList> 0026 struct adjacency_list_graph { 0027 typedef detail::adjacency_list_tag representation; 0028 typedef AdjacencyList data; 0029 }; 0030 0031 } 0032 } 0033 } 0034 0035 #endif // BOOST_MSM_MPL_GRAPH_ADJACENCY_LIST_GRAPH_HPP_INCLUDED
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |