Home
last modified time | relevance | path

Searched refs:bad_graph (Results 1 – 5 of 5) sorted by relevance

/third_party/boost/boost/graph/
Dexception.hpp19 struct BOOST_SYMBOL_VISIBLE bad_graph : public std::invalid_argument struct
21 bad_graph(const std::string& what_arg) : std::invalid_argument(what_arg) {} in bad_graph() function
24 struct BOOST_SYMBOL_VISIBLE not_a_dag : public bad_graph
26 not_a_dag() : bad_graph("The graph must be a DAG.") {} in not_a_dag()
29 struct BOOST_SYMBOL_VISIBLE negative_edge : public bad_graph
32 : bad_graph("The graph may not contain an edge with negative weight.") in negative_edge()
37 struct BOOST_SYMBOL_VISIBLE negative_cycle : public bad_graph
39 negative_cycle() : bad_graph("The graph may not contain negative cycles.") in negative_cycle()
44 struct BOOST_SYMBOL_VISIBLE not_connected : public bad_graph
46 not_connected() : bad_graph("The graph must be connected.") {} in not_connected()
[all …]
Dstoer_wagner_min_cut.hpp239 throw boost::bad_graph( in stoer_wagner_min_cut()
Dmaximum_adjacency_search.hpp243 throw boost::bad_graph( in maximum_adjacency_search()
/third_party/boost/libs/graph/test/
Dmetric_tsp_approx.cpp283 catch (const bad_graph& e) in main()
326 catch (const bad_graph& e) in main()
Dstoer_wagner_test.cpp90 boost::bad_graph); in BOOST_AUTO_TEST_CASE()