Skip to content

Support for edge multiplicities in non_distributed_betweenness_centrality #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 4 commits into
base: develop
Choose a base branch
from
Open

Support for edge multiplicities in non_distributed_betweenness_centrality #2

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
818cabc
Fix to make it compatible with boostorg/graph PR #6
javidcf May 19, 2014
dccfcb0
Changes according to graph
javidcf May 19, 2014
4d579f9
Some other simplification.
javidcf May 21, 2014
619a2cd
Added multiplicity_map parameter to non_distributed_betweenness_centr…
javidcf May 23, 2014
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
21 changes: 21 additions & 0 deletions doc/html/non_distributed_betweenness_centrality.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -70,6 +70,24 @@ <h1 class="title"><a class="reference external" href="http://www.osl.iu.edu/rese
WeightMap weight_map,
Buffer sources);

template&lt;typename ProcessGroup, typename Graph, typename CentralityMap,
typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
typename DependencyMap, typename PathCountMap, typename VertexIndexMap,
typename WeightMap, typename MultiplicityMap, typename Buffer&gt;
void
non_distributed_brandes_betweenness_centrality(const ProcessGroup&amp; pg,
const Graph&amp; g,
CentralityMap centrality,
EdgeCentralityMap edge_centrality_map,
IncomingMap incoming,
DistanceMap distance,
DependencyMap dependency,
PathCountMap path_count,
VertexIndexMap vertex_index,
WeightMap weight_map,
MultiplicityMap multiplicity_map,
Buffer sources);

// helper functions
template&lt;typename Graph, typename CentralityMap&gt;
typename property_traits&lt;CentralityMap&gt;::value_type
Expand Down Expand Up @@ -172,6 +190,9 @@ <h1><a class="toc-backref" href="#id2">Parameters</a></h1>
<dd>A model of <a class="reference external" href="http://www.boost.org/libs/property_map/ReadablePropertyMap.html">Readable Property Map</a> whose key type is the edge
descriptor type of the graph <tt class="docutils literal"><span class="pre">g</span></tt>. If not supplied the betweenness
centrality calculation will be unweighted.</dd>
<dt>IN: <tt class="docutils literal"><span class="pre">MultiplicityMap</span> <span class="pre">multiplicity_map</span></tt></dt>
<dd>A model of <a class="reference external" href="http://www.boost.org/libs/property_map/ReadablePropertyMap.html">Readable Property Map</a> whose key type is the edge
descriptor type of the graph <tt class="docutils literal"><span class="pre">g</span></tt>.</dd>
<dt>IN: <tt class="docutils literal"><span class="pre">Buffer</span> <span class="pre">sources</span></tt></dt>
<dd><p class="first">A model of <a class="reference external" href="http://www.boost.org/libs/graph/doc/Buffer.html">Buffer</a> containing the starting vertices for the
algorithm. If <tt class="docutils literal"><span class="pre">sources</span></tt> is empty a complete betweenness
Expand Down
22 changes: 22 additions & 0 deletions doc/non_distributed_betweenness_centrality.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -63,6 +63,24 @@
WeightMap weight_map,
Buffer sources);

template<typename ProcessGroup, typename Graph, typename CentralityMap,
typename EdgeCentralityMap, typename IncomingMap, typename DistanceMap,
typename DependencyMap, typename PathCountMap, typename VertexIndexMap,
typename WeightMap, typename MultiplicityMap, typename Buffer>
void
non_distributed_brandes_betweenness_centrality(const ProcessGroup& pg,
const Graph& g,
CentralityMap centrality,
EdgeCentralityMap edge_centrality_map,
IncomingMap incoming,
DistanceMap distance,
DependencyMap dependency,
PathCountMap path_count,
VertexIndexMap vertex_index,
WeightMap weight_map,
MultiplicityMap multiplicity_map,
Buffer sources);

// helper functions
template<typename Graph, typename CentralityMap>
typename property_traits<CentralityMap>::value_type
Expand Down Expand Up @@ -161,6 +179,10 @@ IN: ``WeightMap weight_map``
descriptor type of the graph ``g``. If not supplied the betweenness
centrality calculation will be unweighted.

IN: ``MultiplicityMap multiplicity_map``
A model of `Readable Property Map`_ whose key type is the edge
descriptor type of the graph ``g``.

IN: ``Buffer sources``
A model of Buffer_ containing the starting vertices for the
algorithm. If ``sources`` is empty a complete betweenness
Expand Down
Loading