Boost logo

Boost Users :

Subject: [Boost-users] [BGL] unordered_set<std::vector<edge_descriptor> >
From: Johan Oudinet (johan.oudinet_at_[hidden])
Date: 2009-04-29 12:34:00


Hi,

I want to keep a set of paths, which are implemented as a vector of
edge_descriptor. I don't care about the order. I just have to add
paths and be able to know the number of different paths present in the
set.

So, I plan to use unordered_set but I'd like to know you opinion about
a hash function, since AFAIK, unordered_set is like an hash_set?

My main issue is to use as few memory as possible, because there will
have a lot of paths in the set. Any idea?

Thanks for your help.

-- 
Johan

Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net