-
Notifications
You must be signed in to change notification settings - Fork 0
/
utvpi_graph_q-inl.h
67 lines (55 loc) · 1.81 KB
/
utvpi_graph_q-inl.h
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
57
58
59
60
61
62
63
64
65
66
67
#ifndef UTVPI_GRAPH_Q_INL_H
#define UTVPI_GRAPH_Q_INL_H
#include "common.h"
/*
* Unfortunately since the base class is a template, we need to stick this->
* everywhere and define the typedefs again.. Annoying.
*/
template <typename T>
std::pair<bool, std::list<ReasonPtr>*> UtvpiGraphQ<T>::Satisfiable() {
std::size_t graph_size = boost::num_vertices(this->graph_);
std::vector<T> distance(graph_size, 0);
std::vector<Vertex> parent(graph_size, 0);
NegVisitor neg_visitor;
/* Detect cycle with Bellman-Ford algorithm. Also this is why we need the
* special_vertex_. */
bool no_neg_cycle = boost::bellman_ford_shortest_paths
(this->graph_, graph_size,
boost::root_vertex(this->special_vertex_).
weight_map(boost::get(boost::edge_bundle, this->graph_)).
distance_map(&distance[0]).
predecessor_map(&parent[0]).
visitor(neg_visitor).
distance_combine(custom_plus<T>()));
#ifdef DEBUG
{
VertexIter v_iter, v_end;
for (boost::tie(v_iter, v_end) = boost::vertices(this->graph_);
v_iter != v_end;
++v_iter) {
std::cout << "Vertex: " << this->graph_[*v_iter]
<< ", its parent: " << parent[*v_iter]
<< ", its distance: " << distance[*v_iter]
<< std::endl;
}
}
#endif
auto neg_cycle = new std::list<ReasonPtr>();
if (!no_neg_cycle) {
#ifdef VERBOSE
std::cout << "UtvpiGraphQ: Found negative weight cycle." << std::endl;
#endif
neg_cycle = GetNegativeCycle(*neg_visitor.neg_edge, parent);
assert(neg_cycle != NULL);
#ifdef DEBUG
for (auto r : *neg_cycle) {
std::cout << "Negative weight cycle: "
<< *r
<< std::endl;
}
#endif
return std::make_pair(false, neg_cycle);
}
return std::make_pair(true, neg_cycle);
}
#endif /* UTVPI_GRAPH_Q_INL_H */