NAME

Graph::Undirected::Hamiltonicity::Spoof - spoof undirected graphs.

SYNOPSIS

    use Graph::Undirected::Hamiltonicity::Spoof qw(&spoof_known_hamiltonian_graph);

    my $v = 30;
    my $e = 50;
    my $g = spoof_known_hamiltonian_graph($v,$e);

    ### $g is an instance of Graph::Undirected
    ### $g is a random Hamiltonian graph with $v vertices and $e edges.

EXPORT

No symbols are exported by default.

To load all the subroutines of this package:

    use Graph::Undirected::Hamiltonicity::Spoof qw(:all);

The subroutines that can be imported individually, by name, are:

• spoof_canonical_hamiltonian_graph()

• spoof_known_hamiltonian_graph()

• spoof_random_graph()

• spoof_randomish_graph()

SUBROUTINES

spoof_canonical_hamiltonian_graph

Takes: $v, the number of vertices desired.

Returns: a Graph::Undirected with $v vertices, and $v edges. This graph is not random, but the canonical, ( regular-polygon-shaped ) Hamiltonian Cycle.

spoof_known_hamiltonian_graph

Spoof a randomized Hamiltonian graph with the specified number of vertices and edges.

Takes: $v, the number of vertices desired. $e, the number of edges desired. ( optional )

Returns: a Graph::Undirected with $v vertices, and $e edges. This graph is random, and Hamiltonian.

AUTHOR

Ashwin Dixit, <ashwin at ownlifeful dot com>