1 //=======================================================================
2 // Copyright 2002 Indiana University.
3 // Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
5 // Distributed under the Boost Software License, Version 1.0. (See
6 // accompanying file LICENSE_1_0.txt or copy at
7 // http://www.boost.org/LICENSE_1_0.txt)
8 //=======================================================================
10 #ifndef BOOST_GRAPH_EXCEPTION_HPP
11 #define BOOST_GRAPH_EXCEPTION_HPP
18 struct BOOST_SYMBOL_VISIBLE bad_graph : public std::invalid_argument {
19 bad_graph(const std::string& what_arg)
20 : std::invalid_argument(what_arg) { }
23 struct BOOST_SYMBOL_VISIBLE not_a_dag : public bad_graph {
25 : bad_graph("The graph must be a DAG.")
29 struct BOOST_SYMBOL_VISIBLE negative_edge : public bad_graph {
31 : bad_graph("The graph may not contain an edge with negative weight.")
35 struct BOOST_SYMBOL_VISIBLE negative_cycle : public bad_graph {
37 : bad_graph("The graph may not contain negative cycles.")
41 struct BOOST_SYMBOL_VISIBLE not_connected : public bad_graph {
43 : bad_graph("The graph must be connected.")
47 struct BOOST_SYMBOL_VISIBLE not_complete : public bad_graph {
49 : bad_graph("The graph must be complete.")
55 #endif // BOOST_GRAPH_EXCEPTION_HPP