Searched refs:B_C (Results 1 – 4 of 4) sorted by relevance
| /third_party/boost/libs/msm/example/mpl_graph/ |
| D | incidence_list_graph.cpp | 26 struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; struct
29 mpl::vector<B_C,B,C>,
37 BOOST_MPL_ASSERT(( boost::is_same<mpl_graph::source<B_C,some_graph>::type, B> ));
44 …_ASSERT(( mpl_utils::set_equal<mpl_graph::out_edges<B,some_graph>::type, mpl::vector<B_F,B_C> > ));
49 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::in_edges<C,some_graph>::type, mpl::vector<B_C> >…
|
| D | adjacency_list_graph.cpp | 30 struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; struct
34 mpl::pair<B, mpl::vector<mpl::pair<B_C, C>,
43 BOOST_MPL_ASSERT(( boost::is_same<mpl_graph::source<B_C,some_graph>::type, B> ));
52 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::out_edges<B,some_graph>::type, mpl::vector<B_C,B…
58 BOOST_MPL_ASSERT(( mpl_utils::set_equal<mpl_graph::in_edges<C,some_graph>::type, mpl::vector<B_C> >…
|
| D | breadth_first_search.cpp | 18 struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; struct
31 mpl::vector<B_C,B,C>,
52 mpl::pair<B, mpl::vector<mpl::pair<B_C, C>,
108 BOOST_MPL_ASSERT(( mpl::equal<ex_edges_adj_a::type, mpl::vector<A_B,B_C,B_F,C_D,C_E,C_F> > ));
117 BOOST_MPL_ASSERT(( mpl::equal<tree_edges_adj_a::type, mpl::vector<A_B,B_C,B_F,C_D,C_E> > ));
|
| D | depth_first_search.cpp | 18 struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; struct
32 mpl::vector<B_C,B,C>,
53 mpl::pair<B, mpl::vector<mpl::pair<B_C, C>,
|