9.2 Graph Predicates & Properties
predicate
(graph-named? val) → boolean?
val : graph?
Return #t if graph was created as a named graph.
predicate
(graph-empty? val) → boolean?
val : graph?
Return #t if this graph contains no statements.
procedure
(graph-count graph) → exact-positive-integer?
graph : graph?
Returns the number of statements in the graph, this does not take into account whether there are duplicate statements.
procedure
(graph-order graph) → exact-positive-integer?
graph : graph?
Returns the order of the graph, or the number of vertices. For RDF a vertex is defined as any
resource? or blank-node? in the graph.