tinkerpop/blueprints — pull request #212 by raymanrt (2012-02-01 00:30:03+00:00)
Title: Simplified contains based methods

I think that, given the specification of:
* Graph.getVertex(Object id) ...returns the vertex referenced by the provided identifier or null when no such vertex exists
* vertex.getId() An identifier that is unique to its inheriting class. All vertices of a graph must have unique identifiers. All edges of a graph must have unique identifiers

my implementation shoul always be more efficient, since it doesn't require a loop over vertices/edges.