Re: efficient CP-based shortest path algorithm in Eclipse?

From: Thom Fruehwirth <>
Date: Fri 12 Jan 2001 09:22:09 AM GMT
Message-ID: <> wrote:
> Hi.
> I'm looking for an efficient implementation of a
> CP-based shortest-path shortest path algorithm
> in Eclipse. Does anyone have something like that?

Look at the path concistency constraint solver available with
the chr (constraint handling rules) library of Eclipse. It is
easy to adapt it to compute the shortest path.

Thom Fruehwirth
Received on Fri Jan 12 09:24:51 2001

This archive was generated by hypermail 2.1.8 : Wed 16 Nov 2005 06:07:07 PM GMT GMT