A typed graph is a morphism whose codomain is the type graph.

Obtain the untyped version of the typed graph

Obtain the type graph from a typed graph

Test if the typed graph is empty

Infinite list of new node instances of a typed graph

Infinite list of new edge instances of a typed graph

Obtain a list of tuples (nodeId, typeId) for nodes in the graph.

Obtain a list of tuples (edgeId, srcId, tgtId, typeId) for edges in the graph.

Obtain the list of untyped nodes, i.e., the list of node ids from the typed graph domain

Obtain the list of untyped edges, i.e., the list of edge ids from the typed graph domain