GraphDiff

GraphDiff(
    removed_nodes: tuple[OmkObject, ...] = (),
    added_nodes: tuple[OmkObject, ...] = (),
    removed_edges: tuple[tuple[OmkObject, OmkEdge, OmkObject], ...] = (),
    added_edges: tuple[tuple[OmkObject, OmkEdge, OmkObject], ...] = (),
    rearranged: bool = False,
)

What changes from one graph to another, counted by content (see OmkGraph.diff).

Where several equal nodes are in surplus, which of them is reported is arbitrary; an edge is reported with its source and target. rearranged is True when the counts all agree but the graphs are still not equivalent: the same things, wired differently among nodes of equal content, which a count cannot place.

Attributes

Name	Description
removed_nodes
added_nodes
removed_edges
added_edges
rearranged

Methods

Name	Description
__str__

__str__

__str__()