NAME

  Algorithm::SocialNetwork - Social Network Analysis

SYNOPSIS

    use Graph::Undirected;
    use Algorithm::SocialNetwork;

    my $G = Graph::Undirected->new();
    $G->add_edges([qw(a b)], [qw(b c)]);
    my $algo = Algorithm::SocialNetwork->new(graph => $G3);
    my $BC = $algo->BetweenessCentrality();
    # $BC->{a} is 0
    # $BC->{b} is 2
    # $BC->{c} is 0

DESCRIPTION

So far this module implement the algorithm provided in [1]. More handy algorithm would be included in the future. Please consult SYNOPSIS for all of it's usage.

SEE ALSO

    [1] Ulrik Brandes,
    A Faster Algorithm for Betweenness Centrality,
    http://www.inf.uni-konstanz.de/algo/publications/b-fabc-01.pdf

COPYRIGHT

Copyright 2004 by Kang-min Liu <gugod@gugod.org>.

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

See <http://www.perl.com/perl/misc/Artistic.html>