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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/*
CLAW - a C++ Library Absolutely Wonderful
CLAW is a free library without any particular aim but being useful to
anyone.
Copyright (C) 2005-2011 Julien Jorge
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
contact: julien.jorge@gamned.org
*/
/**
* \file graph_algorithm.tpp
* \brief Graph algorithms implementation.
* \author Julien Jorge
*/
#include <queue>
#include <stack>
/*---------------------------------------------------------------------------*/
/**
* \brief Constructor.
* \param g Graph to scan.
* \param source Start_Vertexing vertex.
* \param events User's processings.
*/
template<class Graph, class Events>
claw::breadth_scan<Graph, Events>::breadth_scan( const Graph& g,
const vertex_type& source,
Events& events )
: m_g(g), m_source(source), m_events(events)
{
} // breadth_scan::breadth_scan() [constructor]
/*---------------------------------------------------------------------------*/
/**
* \brief Performs the scan.
*/
template<class Graph, class Events>
void claw::breadth_scan<Graph, Events>::operator()()
{
coloration seen_vertices;
std::queue<vertex_type> pending_vertices;
vertex_type current_vertex;
std::vector<vertex_type> neighbourhood;
typename std::vector<vertex_type>::const_iterator it;
m_events.init(m_g);
for (vertex_iterator it_v=m_g.vertex_begin(); it_v!=m_g.vertex_end(); ++it_v)
seen_vertices[*it_v] = 0;
seen_vertices[m_source] = 1;
pending_vertices.push( m_source );
while ( !pending_vertices.empty() )
{
current_vertex = pending_vertices.front();
m_events.start_vertex(current_vertex);
m_g.neighbours( current_vertex, neighbourhood );
for( it = neighbourhood.begin(); it != neighbourhood.end(); ++it )
{
if ( seen_vertices[*it] == 0 )
{
m_events.visit_edge(current_vertex, *it);
seen_vertices[*it] = 1;
}
}
pending_vertices.pop();
m_events.end_vertex( current_vertex );
seen_vertices[current_vertex] = 2;
}
} // breadth_scan::operator()
//****************************** depth_scan ***********************************
/*---------------------------------------------------------------------------*/
/**
* \brief Constructor.
* \param g Graph to scan.
* \param events User's processings.
*/
template<class Graph, class Events>
claw::depth_scan<Graph, Events>::depth_scan( const Graph& g, Events& events )
: m_g(g), m_events(events)
{
} // depth_scan::depth_scan() [constructor]
/*---------------------------------------------------------------------------*/
/**
* \brief Performs the scan.
*/
template<class Graph, class Events>
void claw::depth_scan<Graph, Events>::operator()()
{
coloration seen_vertices;
vertex_iterator it;
m_events.init(m_g);
for (it=m_g.vertex_begin(); it!=m_g.vertex_end(); ++it)
seen_vertices[*it] = 0;
for (it = m_g.vertex_begin(); it!=m_g.vertex_end(); ++it)
if ( seen_vertices[*it] == 0 )
recursive_scan( *it, seen_vertices );
} // depth_scan::operator()()
/*---------------------------------------------------------------------------*/
/**
* \brief Performs the recursive part of the scan.
*/
template<class Graph, class Events>
void claw::depth_scan<Graph, Events>::recursive_scan
( const vertex_type& s, coloration& seen_vertices )
{
std::vector<vertex_type> neighbourhood;
typename std::vector<vertex_type>::const_iterator it;
m_events.start_vertex(s);
seen_vertices[s] = 1;
m_g.neighbours( s, neighbourhood );
for( it = neighbourhood.begin(); it != neighbourhood.end(); ++it )
if ( seen_vertices[*it] == 0 )
{
m_events.visit_edge(s, *it);
recursive_scan( *it, seen_vertices );
}
m_events.end_vertex(s);
seen_vertices[s] = 2;
} // depth_scan::operator()
//********************** topological_sort ***********************************
/*---------------------------------------------------------------------------*/
/**
* \brief Initialize the scan.
* \param g The graph that will be scanned.
*/
template<class Graph>
void claw::topological_sort<Graph>::init( const Graph& g )
{
m_result.resize( g.vertices_count() );
m_next_index = (int)g.vertices_count()-1;
} // topological_sort::init()
#include <iostream>
/*---------------------------------------------------------------------------*/
template<class Graph>
void claw::topological_sort<Graph>::end_vertex( const vertex_type& s )
{
m_result[m_next_index] = s;
--m_next_index;
} // topological_sort::end()
/*---------------------------------------------------------------------------*/
template<class Graph>
void claw::topological_sort<Graph>::operator()( const Graph& g )
{
claw::depth_scan< Graph, self_type > scan( g, *this );
scan();
} // topological_sort::operator()()
/*---------------------------------------------------------------------------*/
template<class Graph>
const typename claw::topological_sort<Graph>::vertex_type &
claw::topological_sort<Graph>::operator[](unsigned int index) const
{
return m_result[index];
} // topological_sort::operator[]()
/*---------------------------------------------------------------------------*/
template<class Graph>
typename claw::topological_sort<Graph>::const_iterator
claw::topological_sort<Graph>::begin() const
{
return m_result.begin();
} // topological_sort::begin()
/*---------------------------------------------------------------------------*/
template<class Graph>
typename claw::topological_sort<Graph>::const_iterator
claw::topological_sort<Graph>::end() const
{
return m_result.end();
} // topological_sort::end()
|
