Graph::Maker::SmallWorldBA(3pm)

Usage

Creates a small world graph according to the Barabási-Albert model. A small world graph has an approximate power law degree distribution and a high clustering coefficient. If the graph is directed then edges are added in both directions to create an undirected graph.

        use strict;
        use warnings;
        use Graph;
        use Graph::Maker;
        use Graph::Maker::SmallWorldBA;
        my $g = new Graph::Maker('small_world_ba', N => 10, M => 2, undirected => 1);
        my $g2 = new Graph::Maker('small_world_ba', N => 10, M => 2, callback => sub {print "Node added\n"}, undirected => 1);
        # work with the graph

Version

Version 0.01

Functions

new %params

Creates a small world graph with N nodes added on M edges at each step (the minimum number of edges per node) according to the Barabási-Albert model. The recognized parameters are N, M, graph_maker, and callback any others are passed onto Graph's constructor. If N is not given it defaults to 0. If M is not given it defaults to 1. callback allows one to simulate the growth of a preferential attachment network, callback will be called each time a node is added. If graph_maker is specified it will be called to create the Graph class as desired (for example if you have a subclass of Graph), this defaults to create a Graph with the parameters specified.

Copyright & license

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

Releases

Unchanged in 2 releases since Debian 12 (Bookworm).

12–13