mstrsortlen.pl.in,v

Lin-Kernighan heuristic for the TSP and minimum weight perfect matching

head	1.1;
access;
symbols
	zero-five-zero:1.1
	zero-four-seventeen:1.1
	zero-four-ten:1.1
	zero-four-nine:1.1
	zero-four-eight:1.1
	zero-four-five:1.1
	zero-four-three:1.1
	zero-four-zero:1.1;
locks
	neto:1.1;
comment	@# @;


1.1
date	97.11.07.22.21.54;	author neto;	state Exp;
branches;
next	;


desc
@Reverse sort MST elem lengths.
@


1.1
log
@Initial revision
@
text
@#! @@PERL@@
# @@configure_input@@
# mstsortlen.pl
# Input is $n$ followed by $n$ floating point numbers, one to a line.
# Output is the $n$ numbers, in increasing order.

$tmp_file = "/tmp/mstsortlen.$$";
open(TMP,"|sort -n >$tmp_file") # Relies on numeric sort!
	|| die "Can't open $tmp_file for writing"; 
$num_lines = <>;
while( <> ) { print TMP; }
close(TMP);
print $num_lines;
open(TMP,"<$tmp_file")
	|| die "Can't open $tmp_file for reading"; 
while(<TMP>) { print; }
unlink($tmp_file);
@