You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently the equivalent() methods match for
[Cd,Cs].equivalent([Cd,Cb,H]) = True
[Cd,Cb,H].equivalent([Cd,Cs]) = True
[R].equivalent([Cs]) = True
[Cs].equivalent([R]) = True
etc.
and the subgraph matching is confusingly named too.
I propose methods called self.isSpecificCaseOf(other) that is true if they are identical or self is fully contained within other (other is equal to or more general than self).
We may also need exact matching, such as self.isIdenticalTo(other) that is true only if they match exactly.
The text was updated successfully, but these errors were encountered:
I think we now use isSpecificCaseOf() rather than (or in addition to??) equivalent() so I'm closing this issue. (although perhaps equivalent should become isIdenticalTo() for further clarity
Currently the equivalent() methods match for
[Cd,Cs].equivalent([Cd,Cb,H]) = True
[Cd,Cb,H].equivalent([Cd,Cs]) = True
[R].equivalent([Cs]) = True
[Cs].equivalent([R]) = True
etc.
and the subgraph matching is confusingly named too.
I propose methods called self.isSpecificCaseOf(other) that is true if they are identical or self is fully contained within other (other is equal to or more general than self).
We may also need exact matching, such as self.isIdenticalTo(other) that is true only if they match exactly.
The text was updated successfully, but these errors were encountered: