Home
last modified time | relevance | path

Searched refs:is_bipartite (Results 1 – 3 of 3) sorted by relevance

/third_party/boost/libs/graph/test/
Dbipartite_test.cpp69 void check_bipartite(const Graph& g, IndexMap index_map, bool is_bipartite) in check_bipartite() argument
82 bool first_result = boost::is_bipartite(g, index_map, partition_map); in check_bipartite()
84 BOOST_TEST(first_result == boost::is_bipartite(g, index_map)); in check_bipartite()
89 BOOST_TEST(first_result == is_bipartite); in check_bipartite()
95 if (is_bipartite) in check_bipartite()
106 if (is_bipartite) in check_bipartite()
209 BOOST_TEST(is_bipartite(bipartite_vector_graph)); in main()
210 BOOST_TEST(!is_bipartite(non_bipartite_vector_graph)); in main()
/third_party/boost/boost/graph/
Dbipartite.hpp200 bool is_bipartite( in is_bipartite() function
243 bool is_bipartite(const Graph& graph, const IndexMap index_map) in is_bipartite() function
248 return is_bipartite(graph, index_map, partition_map); in is_bipartite()
260 template < typename Graph > bool is_bipartite(const Graph& graph) in is_bipartite() function
262 return is_bipartite(graph, get(vertex_index, graph)); in is_bipartite()
/third_party/boost/libs/graph/example/
Dbipartite_example.cpp28 bool bipartite = is_bipartite(g); in print_bipartite()
44 is_bipartite(g, get(vertex_index, g), partition_map); in print_bipartite()