NAME

       Graph::Maker::CompleteBipartite - Creates a complete bipartite graph.

VERSION

       Version 0.01

SYNOPSIS

       Creates a complete bipartite graph with N1 nodes in one set and N2 in the other.  A
       complete bipartite graph is one in which it can be decomposed into two unique sets with
       edges only between these sets, and every node in one set is linked to every node in the
       other set.  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::CompleteBipartite;

               my (@a, @b);
               $g = new Graph::Maker('complete_bipartite', N1 => 5, N2 => 4, undirected => 1);
               # work with the graph

FUNCTIONS

   new %params
       Creates a complete bipartite graph with N1 (N2) in the first (second) set.  The recognized
       parameters are N1, N2, graph_maker, and any others will be passed onto Graph's
       constructor. If N1 or N2 is not given, they default to 0. If graph_maker is specified, it
       will be called to create the Graph class (for example if you have a subclass of Graph);
       otherwise, this defaults to create a Graph with the parameters specified.

AUTHOR

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

BUGS

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

       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.