molfoundry.MatchApplication#

class molfoundry.MatchApplication(edge, vertexMap)#

Bases: NamedTuple

The result of DG.Builder.applyMatch().

edge is the hyperedge of the derivation; its targets are the products. vertexMap is the atom map of exactly the applied match. An entry with both a source and a target is a vertex that survives, from the given graphs into a product; a source of None is a vertex the rule created, a target of None one it deleted. A source’s sourceInstance counts listings: instance k of a graph is its k-th occurrence in the given list.

Create new instance of MatchApplication(edge, vertexMap)

Parameters:
edge: HyperEdge#

Alias for field number 0

vertexMap: VertexMap#

Alias for field number 1