Skip to content

Support for edge multiplicities in brandes_betweenness_centrality #6

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
javidcf wants to merge 7 commits into
base: develop
Choose a base branch
from
Open

Support for edge multiplicities in brandes_betweenness_centrality #6

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
cef818d
Support for edge multiplicities in brandes_betweenness_centrality
javidcf Apr 25, 2014
b625638
Betweenness with multiplicitites and without weights
javidcf Apr 30, 2014
a33e720
Merge remote-tracking branch 'upstream/develop' into develop
javidcf Apr 30, 2014
6e0e073
Fixed a wrong call to make_static_one_property
javidcf May 12, 2014
5ab5134
Some slight code simplification.
javidcf May 19, 2014
337f84d
Some other simplifications
javidcf May 21, 2014
39ad1fe
Little changes in betweenness_centrality
javidcf Jul 17, 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
33 changes: 31 additions & 2 deletions doc/betweenness_centrality.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -57,6 +57,20 @@ <h1><img src="figs/python.gif" alt="(Python)"/><tt>brandes_betweenness_centralit
VertexIndexMap vertex_index,
WeightMap weight_map);

template&lt;typename Graph, typename CentralityMap, typename EdgeCentralityMap,
typename IncomingMap, typename DistanceMap, typename DependencyMap,
typename PathCountMap, typename VertexIndexMap, typename WeightMap,
typename MultiplicityMap&gt;
void
brandes_betweenness_centrality(const Graph&amp; g, CentralityMap centrality_map,
EdgeCentralityMap edge_centrality,
IncomingMap incoming,
DistanceMap distance, DependencyMap dependency,
PathCountMap path_count,
VertexIndexMap vertex_index,
WeightMap weight_map,
MultiplicityMap multiplicity_map);

<em>// helper functions</em>
template&lt;typename Graph, typename CentralityMap&gt;
void
Expand Down Expand Up @@ -271,12 +285,12 @@ <h3>Named parameters</h3>
<b>Python</b>: Unsupported parameter.
</blockquote>

IN: <tt>weight_map(WeightMap w_map)</tt>
IN: <tt>weight_map(WeightMap weight_map)</tt>
<blockquote>
The weight or ``length'' of each edge in the graph. The weights
must all be non-negative, and the algorithm will throw a
<a href="./exception.html#negative_edge"><tt>negative_edge</tt></a>
exception is one of the edges is negative.
exception if one of the edges is negative.
The type <tt>WeightMap</tt> must be a model of
<a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
the graph needs to be usable as the key type for the weight
Expand All @@ -286,6 +300,21 @@ <h3>Named parameters</h3>
<b>Python</b>: If supplied, must be an <tt>edge_double_map</tt> for the graph.
</blockquote>

IN: <tt>multiplicity_map(MultiplicityMap multiplicity_map)</tt>
<blockquote>
The multiplicity of each edge in the graph. The multiplicities
must all be positive, and the algorithm will throw a
<a href="./exception.html#nonpositive_edge"><tt>nonpositive_edge</tt></a>
exception if one of the edges is non-positive.
The type <tt>MultiplicityMap</tt> must be a model of
<a href="../../property_map/doc/ReadablePropertyMap.html">Readable Property Map</a>. The edge descriptor type of
the graph needs to be usable as the key type for the multiplicity
map. The value type for this map must be
the same as the value type of the distance map.<br>
<b>Default:</b> All edge multiplicities are assumed to be one.
<b>Python</b>: Unsupported parameter.
</blockquote>

<h3>Complexity</h3>
The time complexity is <em>O(VE)</em> for unweighted graphs and
<em>O(VE + V(V+E) log V)</em> for weighted graphs. The space complexity
Expand Down
5 changes: 4 additions & 1 deletion doc/exception.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,10 @@ <h3>Synopsis</h3>
struct <a name="not_a_dag">not_a_dag</a> : public bad_graph {
not_a_dag();
};
struct <a name="negative_edge">negative_edge</a> : public bad_graph {
struct <a name="nonpositive_edge">nonpositive_edge</a> : public bad_graph {
negative_edge();
};
struct <a name="negative_edge">negative_edge</a> : public nonpositive_edge {
negative_edge();
};
struct <a name="negative_cycle">negative_cycle</a> : public bad_graph {
Expand Down
Loading