[Jeremy Hylton] > I'm not familiar with any algorithms for the graph isomorphism > problem, 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). > but I took a stab at a simple comparison algorithm. The idea > is to detect comparisons that would cross back-edges in the object > graphs. Instead of starting a new comparison, assume they are the > same. If, in fact, the objects are not the same, they must differ in > some other way; some other part of the comparison will fail. Bingo! That's the key trick.
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