File Coverage

blib/lib/Graph/MoreUtils.pm

Criterion	Covered	Total	%
statement	24	25	96.0
branch			n/a
condition			n/a
subroutine	10	11	90.9
pod	4	4	100.0
total	38	40	95.0

package Graph::MoreUtils;

# ABSTRACT: Utilities for graphs
our $VERSION = '0.3.0'; # VERSION

=head1 NAME

Graph::MoreUtils - utilities for graphs

=head1 SYNOPSIS

    use Graph::MoreUtils qw( line );
    use Graph::Undirected;

    my $G = Graph::Undirected->new;

    # Greate graph here

    # Get line graph for $G:
    my $L = line( $G );

=cut

use strict;
use warnings;

use parent Exporter::;

use Graph::MoreUtils::Line;
use Graph::MoreUtils::Replace;
use Graph::MoreUtils::SSSR;
use Graph::MoreUtils::Smooth;

our @EXPORT_OK = qw(
    SSSR
    graph_replace
    line
    smooth
);

=head2 C

Finds the Smallest Set of Smallest Rings (SSSR) in L objects.
Thus it should work with any L object.
The code is largely taken from the C package (L).

The algorithm returns a superset of minimum cycle basis of a graph in order to produce deterministic results.
As a result it does not succumb to the counterexample of oxabicyclo[2.2.2]octane (L, section "SSSR and Uniqueness").
The algorithm has means to control the maximum size of rings included in the SSSR to reduce its complexity.
The default value of C stands for no limit.

=cut

sub SSSR { &Graph::MoreUtils::SSSR::SSSR }

=head2 C

Replaces one or more vertices (C<@old>) in the graph with a given one (C<$new>).
All edges between the replaced vertices are removed and all edges with other vertices become a reconnected to the new one.

=cut

sub graph_replace { &Graph::MoreUtils::Replace::replace }

=head2 C

Generates line graphs for L objects.
Line graph is constructed nondestructively and returned from the call.
Both simple and multiedged, undirected and directed graphs are supported.

Call accepts additional options hash.
Currently only one option is supported, C, which treats the input graph as having self-loops on pendant vertices, that is, increasing the degrees of vertices having degrees of 1.
Thus they are not "lost" during line graph construction.
In the resulting line graph these self-loops are represented as instances of L.
This does not work with directed graphs yet.

=cut

sub line { &Graph::MoreUtils::Line::line }

=head2 C

Smooths the given graph by collating vertices of degree 2.

=cut

sub smooth { &Graph::MoreUtils::Smooth::smooth }

=head1 SEE ALSO

perl(1)

=head1 AUTHORS

Andrius Merkys, [e-mail]

=cut

1;