The point is neither easier not more efficient. Please take the product of both factors. Constructing a graph in C++ and finding matching in it is not any harder in C++ than it is in Oz (well, apart from memory management). However it is at least one order of magnitude faster,
Christian -----Original Message----- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Luis Quesada Sent: Wednesday, October 26, 2005 11:17 PM To: [EMAIL PROTECTED] Subject: Re: Implementing constraints Grégoire Dooms wrote: > Christian Schulte wrote: > <snip> > >> But alos, as it comes to numerical and graph algorithms, C++ is just >> the better pick. >> > <snip> > > I second Christian on this. I have been implementing graph constraint > propagators > in Oz (using Oz not C++) during one year. > And I can assure you Oz is not the right choice when you want to > implement graph algorithms. > They are most of the time easier to implement using an imperative > paradigm and > Oz is not very convenient to use for imperative programming. > I think the point of the discussion has changed: we are no longer talking about efficiency but about expressivity. I am afraid I will need a particular example of a graph algorithm that is easier to implement in C++ with respect to Oz. Luis ____________________________________________________________________________ _____ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
