63e88f80
 Hu Chunming
提交三方库
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
|
//=======================================================================
// Copyright 2002 Indiana University.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#ifndef BOOST_GRAPH_EXCEPTION_HPP
#define BOOST_GRAPH_EXCEPTION_HPP
#include <stdexcept>
#include <string>
namespace boost
{
struct BOOST_SYMBOL_VISIBLE bad_graph : public std::invalid_argument
{
bad_graph(const std::string& what_arg) : std::invalid_argument(what_arg) {}
};
struct BOOST_SYMBOL_VISIBLE not_a_dag : public bad_graph
{
not_a_dag() : bad_graph("The graph must be a DAG.") {}
};
struct BOOST_SYMBOL_VISIBLE negative_edge : public bad_graph
{
negative_edge()
: bad_graph("The graph may not contain an edge with negative weight.")
{
}
};
struct BOOST_SYMBOL_VISIBLE negative_cycle : public bad_graph
{
negative_cycle() : bad_graph("The graph may not contain negative cycles.")
{
}
};
struct BOOST_SYMBOL_VISIBLE not_connected : public bad_graph
{
not_connected() : bad_graph("The graph must be connected.") {}
};
struct BOOST_SYMBOL_VISIBLE not_complete : public bad_graph
{
not_complete() : bad_graph("The graph must be complete.") {}
};
} // namespace boost
#endif // BOOST_GRAPH_EXCEPTION_HPP
|
