boost/graph/graph_stats.hpp

   1 // Copyright 2005 The Trustees of Indiana University.
   2
   3 // Use, modification and distribution is subject to the Boost Software
   4 // License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
   5 // http://www.boost.org/LICENSE_1_0.txt)
   6
   7 //  Authors: Alex Breuer
   8 //           Andrew Lumsdaine
   9 #ifndef BOOST_GRAPH_GRAPH_STATS_HPP
  10 #define BOOST_GRAPH_GRAPH_STATS_HPP
  11
  12 #include <map>
  13 #include <list>
  14 #include <boost/graph/iteration_macros.hpp>
  15
  16 namespace boost { namespace graph {
  17
  18 template<typename Graph>
  19 struct  sort_edge_by_origin {
  20 public:
  21   typedef typename graph_traits<Graph>::edge_descriptor edge_type;
  22
  23   explicit sort_edge_by_origin( Graph& g ) : g(g) {}
  24
  25   inline bool operator()( edge_type a, edge_type b ) {
  26     return source( a, g ) == source( b, g ) ? target( a, g ) < target( b, g ) :
  27       source( a, g ) < source( b, g );
  28   }
  29
  30 private:
  31   Graph& g;
  32 };
  33
  34 template<typename Graph>
  35 struct  equal_edge {
  36 public:
  37   typedef typename graph_traits<Graph>::edge_descriptor edge_type;
  38
  39   explicit equal_edge( Graph& g ) : g(g) {}
  40
  41   inline bool operator()( edge_type a, edge_type b ) {
  42     return source( a, g ) == source( b, g ) &&
  43       target( a, g ) == target( b, g );
  44   }
  45
  46 private:
  47   Graph& g;
  48 };
  49
  50 template<typename Graph>
  51 unsigned long num_dup_edges( Graph& g ) {
  52   typedef typename graph_traits<Graph>::edge_iterator e_iterator_type;
  53   typedef typename graph_traits<Graph>::edge_descriptor edge_type;
  54
  55   std::list<edge_type> all_edges;
  56
  57   BGL_FORALL_EDGES_T( e, g, Graph ) {
  58     all_edges.push_back( e );
  59   }
  60
  61   sort_edge_by_origin<Graph> cmp1( g );
  62   all_edges.sort( cmp1 );
  63   equal_edge<Graph> cmp2( g );
  64   all_edges.unique( cmp2 );
  65
  66   return num_edges( g ) - all_edges.size();
  67 }
  68
  69
  70 template<typename Graph>
  71 std::map<unsigned long, unsigned long> dup_edge_dist( Graph& g ) {
  72   std::map<unsigned long, unsigned long> dist;
  73   typedef typename graph_traits<Graph>::adjacency_iterator a_iterator_type;
  74   typedef typename graph_traits<Graph>::vertex_descriptor vertex_type;
  75
  76
  77   BGL_FORALL_VERTICES_T( v, g, Graph ) {
  78     std::list<vertex_type> front_neighbors;
  79     a_iterator_type a_iter, a_end;
  80     for( tie( a_iter, a_end ) = adjacent_vertices( v, g );
  81          a_iter != a_end; ++a_iter ) {
  82       front_neighbors.push_back( *a_iter );
  83     }
  84
  85     front_neighbors.sort();
  86     front_neighbors.unique();
  87     dist[out_degree( v, g ) - front_neighbors.size()] += 1;
  88   }
  89   return dist;
  90 }
  91
  92 template<typename Graph>
  93 std::map<unsigned long, unsigned long> degree_dist( Graph& g ) {
  94   std::map<unsigned long, unsigned long> dist;
  95   typedef typename graph_traits<Graph>::adjacency_iterator a_iterator_type;
  96   typedef typename graph_traits<Graph>::vertex_descriptor vertex_type;
  97
  98   BGL_FORALL_VERTICES_T( v, g, Graph ) {
  99     dist[out_degree( v, g )] += 1;
 100   }
 101
 102   return dist;
 103 }
 104
 105 template<typename Graph>
 106 std::map<unsigned long, double> weight_degree_dist( Graph& g ) {
 107   std::map<unsigned long, double> dist, n;
 108   typedef typename graph_traits<Graph>::adjacency_iterator a_iterator_type;
 109   typedef typename graph_traits<Graph>::vertex_descriptor vertex_type;
 110   typedef typename property_map<Graph, edge_weight_t>::const_type edge_map_type;
 111   typedef typename property_traits<edge_map_type>::value_type
 112     edge_weight_type;
 113
 114   typename property_map<Graph, edge_weight_t>::type  em = get( edge_weight, g );
 115
 116   BGL_FORALL_VERTICES_T( v, g, Graph ) {
 117       edge_weight_type tmp = 0;
 118       BGL_FORALL_OUTEDGES_T( v, e, g, Graph ) {
 119         tmp += em[e];
 120       }
 121       n[out_degree( v, g )] += 1.;
 122       dist[out_degree( v, g )] += tmp;
 123   }
 124
 125   for( std::map<unsigned long, double>::iterator iter = dist.begin();
 126        iter != dist.end(); ++iter ) {
 127     assert( n[iter->first] != 0 );
 128     dist[iter->first] /= n[iter->first];
 129   }
 130
 131   return dist;
 132 }
 133
 134 }}
 135
 136 #endif