/Src/Dependencies/Boost/boost/graph/closeness_centrality.hpp

http://hadesmem.googlecode.com/ · C++ Header · 157 lines · 133 code · 19 blank · 5 comment · 3 complexity · 6eb264fa29f039df4f443b66e614a6c9 MD5 · raw file

  1. // (C) Copyright 2007-2009 Andrew Sutton
  2. //
  3. // Use, modification and distribution are subject to the
  4. // Boost Software License, Version 1.0 (See accompanying file
  5. // LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
  6. #ifndef BOOST_GRAPH_CLOSENESS_CENTRALITY_HPP
  7. #define BOOST_GRAPH_CLOSENESS_CENTRALITY_HPP
  8. #include <boost/graph/detail/geodesic.hpp>
  9. #include <boost/graph/exterior_property.hpp>
  10. namespace boost
  11. {
  12. template <typename Graph,
  13. typename DistanceType,
  14. typename ResultType,
  15. typename Reciprocal = detail::reciprocal<ResultType> >
  16. struct closeness_measure
  17. : public geodesic_measure<Graph, DistanceType, ResultType>
  18. {
  19. typedef geodesic_measure< Graph, DistanceType, ResultType> base_type;
  20. typedef typename base_type::distance_type distance_type;
  21. typedef typename base_type::result_type result_type;
  22. result_type operator ()(distance_type d, const Graph&)
  23. {
  24. function_requires< NumericValueConcept<DistanceType> >();
  25. function_requires< NumericValueConcept<ResultType> >();
  26. function_requires< AdaptableUnaryFunctionConcept<Reciprocal,ResultType,ResultType> >();
  27. return (d == base_type::infinite_distance())
  28. ? base_type::zero_result()
  29. : rec(result_type(d));
  30. }
  31. Reciprocal rec;
  32. };
  33. template <typename Graph, typename DistanceMap>
  34. inline closeness_measure<
  35. Graph, typename property_traits<DistanceMap>::value_type, double,
  36. detail::reciprocal<double> >
  37. measure_closeness(const Graph&, DistanceMap)
  38. {
  39. typedef typename property_traits<DistanceMap>::value_type Distance;
  40. return closeness_measure<Graph, Distance, double, detail::reciprocal<double> >();
  41. }
  42. template <typename T, typename Graph, typename DistanceMap>
  43. inline closeness_measure<
  44. Graph, typename property_traits<DistanceMap>::value_type, T,
  45. detail::reciprocal<T> >
  46. measure_closeness(const Graph&, DistanceMap)
  47. {
  48. typedef typename property_traits<DistanceMap>::value_type Distance;
  49. return closeness_measure<Graph, Distance, T, detail::reciprocal<T> >();
  50. }
  51. template <typename T, typename Graph, typename DistanceMap, typename Reciprocal>
  52. inline closeness_measure<
  53. Graph, typename property_traits<DistanceMap>::value_type, T,
  54. Reciprocal>
  55. measure_closeness(const Graph&, DistanceMap)
  56. {
  57. typedef typename property_traits<DistanceMap>::value_type Distance;
  58. return closeness_measure<Graph, Distance, T, Reciprocal>();
  59. }
  60. template <typename Graph,
  61. typename DistanceMap,
  62. typename Measure,
  63. typename Combinator>
  64. inline typename Measure::result_type
  65. closeness_centrality(const Graph& g,
  66. DistanceMap dist,
  67. Measure measure,
  68. Combinator combine)
  69. {
  70. function_requires< VertexListGraphConcept<Graph> >();
  71. typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
  72. function_requires< ReadablePropertyMapConcept<DistanceMap,Vertex> >();
  73. typedef typename property_traits<DistanceMap>::value_type Distance;
  74. function_requires< NumericValueConcept<Distance> >();
  75. function_requires< DistanceMeasureConcept<Measure,Graph> >();
  76. Distance n = detail::combine_distances(g, dist, combine, Distance(0));
  77. return measure(n, g);
  78. }
  79. template <typename Graph, typename DistanceMap, typename Measure>
  80. inline typename Measure::result_type
  81. closeness_centrality(const Graph& g, DistanceMap dist, Measure measure)
  82. {
  83. function_requires< GraphConcept<Graph> >();
  84. typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
  85. function_requires< ReadablePropertyMapConcept<DistanceMap,Vertex> >();
  86. typedef typename property_traits<DistanceMap>::value_type Distance;
  87. return closeness_centrality(g, dist, measure, std::plus<Distance>());
  88. }
  89. template <typename Graph, typename DistanceMap>
  90. inline double closeness_centrality(const Graph& g, DistanceMap dist)
  91. { return closeness_centrality(g, dist, measure_closeness(g, dist)); }
  92. template <typename T, typename Graph, typename DistanceMap>
  93. inline T closeness_centrality(const Graph& g, DistanceMap dist)
  94. { return closeness_centrality(g, dist, measure_closeness<T>(g, dist)); }
  95. template <typename Graph,
  96. typename DistanceMatrixMap,
  97. typename CentralityMap,
  98. typename Measure>
  99. inline void
  100. all_closeness_centralities(const Graph& g,
  101. DistanceMatrixMap dist,
  102. CentralityMap cent,
  103. Measure measure)
  104. {
  105. function_requires< VertexListGraphConcept<Graph> >();
  106. typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
  107. function_requires< ReadablePropertyMapConcept<DistanceMatrixMap,Vertex> >();
  108. typedef typename property_traits<DistanceMatrixMap>::value_type DistanceMap;
  109. function_requires< ReadablePropertyMapConcept<DistanceMap,Vertex> >();
  110. function_requires< WritablePropertyMapConcept<CentralityMap,Vertex> >();
  111. typedef typename property_traits<DistanceMap>::value_type Distance;
  112. typedef typename property_traits<CentralityMap>::value_type Centrality;
  113. typename graph_traits<Graph>::vertex_iterator i, end;
  114. for(tie(i, end) = vertices(g); i != end; ++i) {
  115. DistanceMap dm = get(dist, *i);
  116. Centrality c = closeness_centrality(g, dm, measure);
  117. put(cent, *i, c);
  118. }
  119. }
  120. template <typename Graph,
  121. typename DistanceMatrixMap,
  122. typename CentralityMap>
  123. inline void
  124. all_closeness_centralities(const Graph& g,
  125. DistanceMatrixMap dist,
  126. CentralityMap cent)
  127. {
  128. function_requires< GraphConcept<Graph> >();
  129. typedef typename graph_traits<Graph>::vertex_descriptor Vertex;
  130. function_requires< ReadablePropertyMapConcept<DistanceMatrixMap,Vertex> >();
  131. typedef typename property_traits<DistanceMatrixMap>::value_type DistanceMap;
  132. function_requires< ReadablePropertyMapConcept<DistanceMap,Vertex> >();
  133. typedef typename property_traits<DistanceMap>::value_type Distance;
  134. typedef typename property_traits<CentralityMap>::value_type Result;
  135. all_closeness_centralities(g, dist, cent, measure_closeness<Result>(g, DistanceMap()));
  136. }
  137. } /* namespace boost */
  138. #endif