Re: Demo: Modelling Cost of Travel Paths Between Towns
Date: Tue, 9 Nov 2004 08:08:45 -0500
Message-ID: <MKqdnThM3cb8XA3cRVn-uQ_at_comcast.com>
"--CELKO--" <jcelko212_at_earthlink.net> wrote in message news:18c7b3c2.0411081414.2f0f8b8e_at_posting.google.com...
> That gets all the (travel_cost = 1) edges in the graph. Next, use
> Warshall's algorithm to fill in travel costs on ('c', 'a'), ('d', 'b')
> and so forth. This will work for any adjacency list model. I would
> do the matrix multiplications in a host language like FORTRAN, C or
> Pascal, but I can do it in pure SQL if I have to (see that section in
> SQL FOR SMARTIES).
Hey, don't forget good old BASIC!!!! I thought that this:
LET MATRIXC = MATRIXA * MATRIXB was one of the coolest features of Dartmouth Basic!
But I suppose that most implementations of BASIC don't have this feature. Received on Tue Nov 09 2004 - 14:08:45 CET