Re: [Boost-Users] Graph: Generic access to vertex/edge properties

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-08-08 09:29:32

Hi Tarjei,

One way is to pass in a comparison functor to your algorithm.

(One my to-do list is a change the implementation of internal properties
to use a heterogeneous associative list class that would know how to check
for equality, etc.)

On 8 Aug 2002, Tarjei Knapstad wrote:
tarjei>
tarjei> The problem, as I see it, is to do a generic consecutive access of all
tarjei> the properties of the current vertex/edge being checked and see if
tarjei> they're equal in both 'g1' and 'g2'.
tarjei>

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------