Re: Shortest path with intermediate nodes algorithm

A.L. wrote:
On 25 Aug 2006 12:26:47 -0700, acamposr@xxxxxxxxx wrote:

Hello. I am looking for a shortest path algorithm with the restriction
of passing through several intermediate nodes.

That is:

INPUT: First Node A, Destination Node B, and a list of intermediate
nodes N1,N2...Nk.
OUTPUT: heuristic aproximation of the shortest path which goes through
A,N1,N2...Nk,B.

All of them or some of them?...

A.L.

And if more than one of them, is the order fixed?

Patricia
.