• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 //=======================================================================
2 // Copyright 2001 Jeremy G. Siek, Andrew Lumsdaine, Lie-Quan Lee,
3 //
4 // Distributed under the Boost Software License, Version 1.0. (See
5 // accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt)
7 //=======================================================================
8 #include <boost/config.hpp>
9 #include <vector>
10 #include <list>
11 #include <boost/graph/biconnected_components.hpp>
12 #include <boost/graph/adjacency_list.hpp>
13 #include <iterator>
14 #include <iostream>
15 
16 namespace boost
17 {
18 struct edge_component_t
19 {
20     enum
21     {
22         num = 555
23     };
24     typedef edge_property_tag kind;
25 } edge_component;
26 }
27 
main()28 int main()
29 {
30     using namespace boost;
31     typedef adjacency_list< vecS, vecS, undirectedS, no_property,
32         property< edge_component_t, std::size_t > >
33         graph_t;
34     typedef graph_traits< graph_t >::vertex_descriptor vertex_t;
35     graph_t g(9);
36     add_edge(0, 5, g);
37     add_edge(0, 1, g);
38     add_edge(0, 6, g);
39     add_edge(1, 2, g);
40     add_edge(1, 3, g);
41     add_edge(1, 4, g);
42     add_edge(2, 3, g);
43     add_edge(4, 5, g);
44     add_edge(6, 8, g);
45     add_edge(6, 7, g);
46     add_edge(7, 8, g);
47 
48     property_map< graph_t, edge_component_t >::type component
49         = get(edge_component, g);
50 
51     std::size_t num_comps = biconnected_components(g, component);
52     std::cerr << "Found " << num_comps << " biconnected components.\n";
53 
54     std::vector< vertex_t > art_points;
55     articulation_points(g, std::back_inserter(art_points));
56     std::cerr << "Found " << art_points.size() << " articulation points.\n";
57 
58     std::cout << "graph A {\n"
59               << "  node[shape=\"circle\"]\n";
60 
61     for (std::size_t i = 0; i < art_points.size(); ++i)
62     {
63         std::cout << (char)(art_points[i] + 'A')
64                   << " [ style=\"filled\", fillcolor=\"red\" ];" << std::endl;
65     }
66 
67     graph_traits< graph_t >::edge_iterator ei, ei_end;
68     for (boost::tie(ei, ei_end) = edges(g); ei != ei_end; ++ei)
69         std::cout << (char)(source(*ei, g) + 'A') << " -- "
70                   << (char)(target(*ei, g) + 'A') << "[label=\""
71                   << component[*ei] << "\"]\n";
72     std::cout << "}\n";
73 
74     return 0;
75 }
76