/ 
SNA-Network-0.21
River stage zero No dependents
/ SNA::Network::Algorithm::Betweenness

NAME

SNA::Network::Algorithm::Betweenness - Calculate betweenneess values for all nodes

SYNOPSIS

use SNA::Network;

my $net = SNA::Network->new();
$net->load_from_pajek_net($filename);
...
my $r = $net->calculate_betweenness;

METHODS

The following methods are added to SNA::Network.

calculate_betweenness

Calculates exact betweenness centrality values for all nodes and edges. Stores the values under the hash entry betweenness for each node and edge object. Uses the algorithm published by Ulrik Brandes in 2001.

You can pass named parameters to control the algorithm: normalise specifies whether you want the betweenness values as the plain number of shortest paths going through the node or edge object (normalise = 0>), or to be normalised to the interval between 0 and 1 (normalise = 1>). It defaults to 1.

AUTHOR

Darko Obradovic, <dobradovic at gmx.de>

BUGS

Please report any bugs or feature requests to bug-sna-network-node at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=SNA-Network. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.

SUPPORT

You can find documentation for this module with the perldoc command.

perldoc SNA::Network

You can also look for information at:

ACKNOWLEDGEMENTS

COPYRIGHT & LICENSE

Copyright 2009 Darko Obradovic, all rights reserved.

This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.