view release on metacpan or  search on metacpan

lib/Algorithm/Networksort/Best.pm  view on Meta::CPAN

networks for inputs of 9 through 23.

=item

Morwenn's 23 and 24-input networks are described at
L<https://github.com/Morwenn/cpp-sort/wiki/Original-research#sorting-networks-23-and-24>.

=item

Ian Parberry, "A computer assisted optimal depth lower bound for sorting
networks with nine inputs", L<http://www.eng.unt.edu/ian/pubs/snverify.pdf>.

=back

=head1 AUTHOR

John M. Gamble may be found at B<jgamble@cpan.org>

=cut

t/svg.t  view on Meta::CPAN

use Algorithm::Networksort;
use strict;
use warnings;

my $nw = nwsrt(inputs => 7, algorithm => "hibbard");
my $show_svg = 0;

eval "use Test::XML::Easy";
if ($@)
{
	plan skip_all => "Test::XML::Easy required for verifying SVG"
}
else
{
	plan tests => 2;
}

	#
	# Start with a simple network.
	#
	my $svg = $nw->graph_svg();