Re: [Boost-users] [graph] Unique vertices using setS

Is there any place where I could enforce unique properties? (i.e. not add a new vertex if it's properties are the same as an existing vertex) My graph is actually an implicit search tree for an A* search so there's lots of nodes which will be revisited via different paths. My current thought is to create the new vertex (which is a search tree state), then simply iterate through all existing vertices to see if any are identical in properties. However if the vertices were sorted by their properties in a set (i.e. weakly ordered), this would be much faster. -Nick