Think about ProvDAG equality criteria
Opened this issue · 0 comments
ChrisKeefe commented
From inline notes
ProvDAG equality checks are currently based on class identity and graph isomorphism.
Is this a reasonable way to define ProvDAG equality? It doesn't take into account the equality of some ProvDAG attributes, but leans on DiGraph isomorphism.
Questions
Are two isomorphic ProvDAGs unequal if one was created without checksum validation?
How about if one has a checksum diff because it's been tinkered with?
If in the future we have a method that produces non-identical results from two identical DiGraphs based on _parsed_artifact_uuids, are those ProvDAGs still equal?