boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-29 19:42:11 +00:00
Code Issues Projects Releases Wiki Activity

Fullly generic BFS, comin' at ya

Browse Source 
[SVN r27541]
This commit is contained in:
Douglas Gregor
2005-03-03 17:22:17 +00:00
parent 3cca66df9c
commit a8488328b1
3 changed files with 57 additions and 46 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
src/python/breadth_first_search.cpp
View File

@@ -99,50 +99,59 @@ struct wrap_bfs_visitor_ref
template<typename Graph>
class default_bfs_visitor : public bfs_visitor<Graph> {};
template<typename Graph>
void
breadth_first_search_v
(const Graph& g,
typename Graph::Vertex s,
const bfs_visitor<Graph>& visitor)
{
if (dynamic_cast<const default_bfs_visitor<Graph>*>(&visitor)) {
// No visitor. Do default BFS
boost::breadth_first_search(g, s,
vertex_index_map(g.get_vertex_index_map()));
} else {
boost::breadth_first_search
(g, s,
vertex_index_map(g.get_vertex_index_map()).
visitor(wrap_bfs_visitor_ref<Graph>(visitor)));
}
}
template<typename Graph>
void
breadth_first_search_qv
(const Graph& g,
typename Graph::Vertex s,
const python_queue<typename Graph::Vertex>& Q)
// const bfs_visitor<Graph>& visitor)
python_queue<typename Graph::Vertex>& Q,
const bfs_visitor<Graph>& visitor)
{
boost::breadth_first_search(g, s,
vertex_index_map(g.get_vertex_index_map()));
typedef typename python_queue<typename Graph::Vertex>::default_queue
default_queue_type;
bool has_default_buffer = dynamic_cast<default_queue_type*>(&Q);
bool has_default_visitor =
dynamic_cast<const default_bfs_visitor<Graph>*>(&visitor);
if (has_default_buffer) {
if (has_default_visitor) {
boost::breadth_first_search(g, s,
vertex_index_map(g.get_vertex_index_map()));
} else {
boost::breadth_first_search
(g, s,
vertex_index_map(g.get_vertex_index_map()).
visitor(wrap_bfs_visitor_ref<Graph>(visitor)));
}
} else {
if (has_default_visitor) {
boost::breadth_first_search(g, s,
buffer(Q).
vertex_index_map(g.get_vertex_index_map()));
} else {
boost::breadth_first_search
(g, s,
buffer(Q).
vertex_index_map(g.get_vertex_index_map()).
visitor(wrap_bfs_visitor_ref<Graph>(visitor)));
}
}
}
void export_breadth_first_search()
{
using boost::python::arg;
// Breadth-first search algorithm
def("breadth_first_search", &breadth_first_search_v<Graph>,
def("breadth_first_search", &breadth_first_search_qv<Graph>,
(arg("graph"), "root_vertex",
arg("buffer") = python_queue<Graph::Vertex>::default_queue(),
arg("visitor") = default_bfs_visitor<Graph>()));
def("breadth_first_search2", &breadth_first_search_qv<Graph>);
// (arg("graph"), "root_vertex",
// arg("buffer") = python_queue<Graph::Vertex>::default_queue()));
def("breadth_first_search", &breadth_first_search_qv<Digraph>,
(arg("graph"), "root_vertex",
arg("buffer") = python_queue<Digraph::Vertex>::default_queue(),
arg("visitor") = default_bfs_visitor<Digraph>()));
}
template<typename Graph>