[futurebasic] [FB] Re: A New Challenge

Message: < previous - next > : Reply : Subscribe : Cleanse
Home   : March 2000 : Group Archive : Group : All Groups

From: tedd@...
Date: Mon, 13 Mar 2000 16:41:04 -0500
To all:

Look to weighted graphs for minimum distance algorithms -- 
specifically minumum spanning trees. There has been a LOT of work on 
these types of problems.

tedd
-- 
_______________________________________________________
http://sperling.com/