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
68
69
70
71
72
73
|
#ifndef DEPTHFIRSTSEARCH_H
#define DEPTHFIRSTSEARCH_H 1
#include "Graph/ContigGraphAlgorithms.h" // for contiguous_in
#include <boost/graph/depth_first_search.hpp>
using boost::graph_traits;
/**
* Perform a depth-first search starting first with vertices with
* deg-(u) = 0 and then visiting any remaining vertices.
*/
template <class Graph, class Visitor, class ColorMap>
void depthFirstSearch(const Graph& g, Visitor vis, ColorMap color, bool ss = false)
{
using boost::color_traits;
using boost::property_traits;
using boost::tie;
typedef graph_traits<Graph> GTraits;
typedef typename GTraits::vertex_descriptor V;
typedef typename GTraits::vertex_iterator Vit;
typedef typename property_traits<ColorMap>::value_type ColorValue;
const ColorValue white = color_traits<ColorValue>::white();
// Initialize the vertices.
Vit uit, ulast;
for (tie(uit, ulast) = vertices(g); uit != ulast; ++uit) {
V u = *uit;
put(color, u, white);
vis.initialize_vertex(u, g);
}
// Visit vertices with deg-(u) = 0.
for (tie(uit, ulast) = vertices(g); uit != ulast; ++uit) {
V u = *uit;
if (get(color, u) == white && in_degree(u, g) == 0) {
vis.start_vertex(u, g);
boost::detail::depth_first_visit_impl(g, u, vis, color,
boost::detail::nontruth2());
}
if (ss) {
++uit;
assert(uit != ulast);
}
}
// Visit vertices where discontiguous-(u).
for (tie(uit, ulast) = vertices(g); uit != ulast; ++uit) {
V u = *uit;
if (get(color, u) == white && !contiguous_in(g, u)) {
vis.start_vertex(u, g);
boost::detail::depth_first_visit_impl(g, u, vis, color,
boost::detail::nontruth2());
}
if (ss) {
++uit;
assert(uit != ulast);
}
}
// Visit the remaining vertices.
for (tie(uit, ulast) = vertices(g); uit != ulast; ++uit) {
V u = *uit;
if (get(color, u) == white) {
vis.start_vertex(u, g);
boost::detail::depth_first_visit_impl(g, u, vis, color,
boost::detail::nontruth2());
}
}
}
#endif
|
