Documentation

Creates a TypedGraphMorphism mapping nodes and edges according to their identifiers.

Test if a nac is partial injective (injective out of m)

Invert a typed graph morphism

Return the nodes ids in the domain of a given TypedGraphMorphism

Return the edges ids in the domain of a given TypedGraphMorphism

Return the edges in the domain of a given TypedGraphMorphism

Return the nodes ids in the codomain of a given TypedGraphMorphism

Return the edges ids in the codomain of a given TypedGraphMorphism

Return the edges in the codomain of a given TypedGraphMorphism

Return the domain graph

Return the codomain graph

Given a TypedGraphMorphism t: G1 -> G2 and a node n in G1, it returns the node in G2 to which n gets mapped

Given a TypedGraphMorphism t: G1 -> G2 and an edge e in G1, it returns the edge in G2 to which e gets mapped

Given two TypedGraphs G1 and G2 and a simple GraphMorphism between them, it returns a TypedGraphMorphism from G1 to G2

TODO: Find a better name for this function, that was repeated both here and in the GraphRule archive | Given the left-hand-side morphism of a rule l : K -> L, a match m : L -> G for this rule, an element e (that can be either a Node or an Edge) and two functions apply (for applying that element in a TypedGraphMorphism) and list (to get all the corresponding elements in the domain of m), it returns true if e is deleted by this rule for the given match

Remove a node from the domain of a typed graph morphism

Remove an edge from the domain of a typed graph morphism

Remove a node from the codomain of a typed graph morphism

Remove an edge from the domain of a typed graph morphism

Given a TypedGraphMorphism tand a node n in the domain of t, return the node in the image of t to which n gets mapped or error in the case of undefined

Given a TypedGraphMorphism tand an edge e in the domain of t, return the edge in the image of t to which e gets mapped or error in the case of undefined

This function adds an edge e1 (with source s1, target t1 and type tp) to the domain of the typed graph morphism, and associate it to e2 It assumes s1, t1, e2, tp already exist, and that e1 does not exist.

This function adds an edge e2 (with source s2, target t2 and type tp) to the codomain of the typed graph morphism It assumes s2, t2, tp already exist, and that e2 does not exist.

This function adds a node n1 (type tp) to the domain of the typed graph morphism, and associate it to n2 It assumes n2 and tp already exist, and that n1 does not exist.

This function adds a node n2 (type tp) to the codomain of the typed graph morphism It assumes tp already exist, and that n2 does not exist.

updates a typed graph morphism, mapping edge e1 to edge e2. It assumes both edges already exist.

updates a typed graph morphism, mapping node n1 to node n2. It assumes both nodes already exist.

updates a typed graph morphism, mapping node n1 to node n2. It assumes both nodes already exist and are of the same type.

Given a TypedGraphMorphism, return its orphan nodes ids

Given a TypedGraphMorphism, return its orphan edges ids

Given a TypedGraphMorphism, return its orphan edges

Given a TypedGraphMorphism tgm, creates an isomorphic TypedGraphMorphism tgm' where the mapping between the domain and codomain can be seen as explicit inclusion (the same ids) Attention: It works only when the typing morphism is injective, otherwise it will produce an invalid TypedGraphMorphism

Given a TypedGraphMorphism tgm, creates an isomorphic TypedGraphMorphism tgm' where the nodes and edges in the domain have the same ids as the ones in the codomain