mirror of
https://github.com/boostorg/graph.git
synced 2026-01-28 07:12:14 +00:00
36 lines
1.1 KiB
C++
36 lines
1.1 KiB
C++
#include <boost/concept_archetype.hpp>
|
|
#include <boost/graph/breadth_first_search.hpp>
|
|
#include <boost/graph/graph_archetypes.hpp>
|
|
|
|
int main()
|
|
{
|
|
using namespace boost;
|
|
typedef default_constructible_archetype<
|
|
sgi_assignable_archetype<
|
|
equality_comparable_archetype<> > > vertex_t;
|
|
{
|
|
vertex_list_graph_archetype<vertex_t, directed_tag,
|
|
allow_parallel_edge_tag> g;
|
|
vertex_t s;
|
|
read_write_property_map_archetype<vertex_t, color_value_archetype> color;
|
|
breadth_first_search(g, s, color_map(color));
|
|
}
|
|
{
|
|
incidence_graph_archetype<vertex_t, directed_tag,
|
|
allow_parallel_edge_tag> g;
|
|
vertex_t s;
|
|
readable_property_map_archetype<vertex_t, std::size_t> v_index;
|
|
breadth_first_search(g, s, vertex_index_map(v_index));
|
|
}
|
|
{
|
|
typedef incidence_graph_archetype<vertex_t, undirected_tag,
|
|
allow_parallel_edge_tag> Graph;
|
|
property_graph_archetype<Graph, vertex_index_t, std::size_t> g;
|
|
vertex_t s;
|
|
bfs_visitor<> v;
|
|
buffer_archetype<vertex_t> b;
|
|
breadth_first_search(g, s, visitor(v).buffer(b));
|
|
}
|
|
return 0;
|
|
}
|