oracular (3) Graph::Maker::Complete.3pm.gz

Provided by: libgraph-maker-perl_0.02-2_all bug

NAME
       Graph::Maker::Complete - Create complete (fully-connected) graphs


VERSION
       Version 0.01


SYNOPSIS
       Creates the complete graph with the number of nodes.  A complete graph has edges between every pair of
       nodes.  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::Complete;

               my $g = new Graph::Maker('complete', N => 4, undirected => 1);
               # work with the graph


FUNCTIONS
   new %params
       Creates the complete graph with the specified number of nodes (N).  The recognized parameters are N, and
       graph_maker any others are passed onto Graph's constructor.  If N is not given it defaults to 0.  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.


AUTHOR
       Matt Spear, "<batman900+cpan at gmail.com>"


BUGS
       None at the moment...

       Please report any bugs or feature requests to "bug-graph-maker-complete 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.