Expand description

An RDF graph, the central notion of the RDF data model, is a collection of triples.

This module provides reusable abstractions for different kinds of graph, as well as a few implementations for them.

Modules

Contains helper functions and macros for testing Graph implementations

Constants

Maximal steps a graph is traversed for proofing isomorphism. If this bound is exceeded the algorithm assumes that the graphs are not isomorphic.

Traits

A graph that can be constructed from a TripleSource

Generic trait for RDF graphs.

Generic trait for mutable RDF graphs.

Marker trait constraining the semantics of Graph and MutableGraph.

Functions

Checks if both graphs are isomorphic blank node equal.

Type Definitions

Type alias for results produced by a graph.

Type alias for fallible hashsets of terms produced by a graph.

Type alias for the terms returned by a graph.

Type alias for the triples returned by a graph.

Type alias for fallible triple iterators produced by a graph.

The hasher used internally for checking isomorphism.

MGResultDeprecated

Type alias for results produced by a mutable graph.