Add the triple t (if possible) to the set belonging to this graph
Returns an iterator over all the Triples that match the triple pattern.
Delete the triple t (if possible) from the set belonging to this graph
For a concrete graph this returns the number of triples in the graph. For graphs
which might infer a
Answer true iff the graph contains a triple that t matches; t may be fluid.
Free all resources, any further use of this Graph is an error.
returns this Graph's prefix mapping. Each call on a given Graph gets the same
Answer true iff this graph is empty. "Empty" means "has as few triples as it can
manage", because an
returns this Graph's bulk-update handler
Answer this Graph's event manager.
Answer this Graph's statistics handler, or null if there isn't one. Every call
to this method on a p
Compare this graph with another using the method described in