[Tim] > Well, while an instance of graph isomorphism, this one is a relatively > simple special case (because "the graphs" here are rooted, directed, and > have ordered children). [Moshe Zadka] > Ordered? What about dictionaries? An ordering of a dict's kids is forced in the context of comparison (see dict_compare in dictobject.c).
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4