File Coverage

blib/lib/Graph/Fast/GraphPM.pm

Criterion	Covered	Total	%
statement	12	18	66.6
branch			n/a
condition			n/a
subroutine	4	9	44.4
pod	1	2	50.0
total	17	29	58.6

package Graph::Fast::GraphPM;

use strict;
use warnings;
use base 'Graph::Fast';

sub noop { 1; }

*add_weighted_edge = \&Graph::Fast::add_edge;

sub add_edge {
	Graph::Fast::add_edge($_[0], $_[1], $_[2], 1);
}

*SP_Dijkstra = \&Graph::Fast::dijkstra;

*SPT_Dijkstra_clear_cache =
*SPT_Bellman_Ford_clear_cache =
	\&noop;

1;

package Graph::Fast_LPQ::GraphPM;

use base 'Graph::Fast::GraphPM';

sub has_lpq { Graph::Fast::GraphPM->new(queue_maker => sub { List::PriorityQueue->new() }); }

sub no_lpq { print STDERR "Creating Graph::Fast_LPQ::GraphPM with Hash::PriorityQueue because List::PriorityQueue isn't installed.\n";
	Graph::Fast::GraphPM->new(); }

eval { require List::PriorityQueue };
if ($@) {
	*new = \&no_lpq;
} else {
	*new = \&has_lpq;
}

1;


__END__