Algorithm-Networksort

 view release on metacpan or  search on metacpan

Changes  view on Meta::CPAN

	  problem (the function that arranges them for graphing, nw_group(), does
	  in fact "parallelize" the comparators so that they'll look nice on the
	  graph). So there's now an option to re-group the list. It's not the
	  default because the default behavior has been there since the beginning
	  of the module.
	  See the documentation for nw_comparator() for more information.
	- Undid use of mark attributes for SVG graphing. Too many inconsistencies
	  between different SVG viewers for me to be sure that I'm doing the right
	  thing.
	- While undoing that change, simplified the code that generates the
	  group/color attributes.  I decided that individually assigning the
	  color attribute to each element was probably a less error-prone mechanism.
	- Updated svg.pl and eps.pl in the eg directory to make use of the
	  color options.
	- Fixed the nw_group() example. It was using the default 'bosenelson'
	  algorithm, but the output was from the 'batcher' algorithm. Oops.
	- Added grouping.pl to the eg directory.
	Wed Feb 10 2010
	- Changed <svg> tag adding xmlns and viewBox attributes.
	* Change input and comparator lines to use mark attributes instead
	  of separate geometric circles.



( run in 0.770 second using v1.01-cache-2.11-cpan-de7293f3b23 )