Graph::Maker::Random - Creates a random graph (using Erdos Renyi or with a specified number of edges)
Creates a random graph with N nodes and with exactly M edges or connects random edges with probability PR. A random graph has N nodes and M random edges, OR for every pair of nodes adds an edge with probability PR (Erdos-Renyi graph). 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::Random; my $g = new Graph::Maker('random', N => 10, M => 2, undirected => 1); my $g = new Graph::Maker('random', N => 100, PR => .01, undirected => 1); # work with the graph
Creates a random graph with N nodes either connecting edges with the given probability (PR) or with the specified number of edges (M); The recognized parameters are graph_maker, N, M, and PR any others are passed onto Graph's constructor. If N is not given it defaults to 0. If PR is not given it defaults to 0. If PR is 1 or M is bigger than N*(N-2)/2 then returns a Complete Graph. If M is not given it defaults to 0. If PR and M are both nonzero ignores M. 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.
<batman900+cpan at gmail.com>
Please report any bugs or feature requests to
bug-graph-maker-random at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Graph-Maker. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.
Copyright 2008 Matt Spear, all rights reserved.
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.