Re:Quasi-Polynomial Algorithm for Graph Isomorphism
by ThePhysicist on Thursday November 05, 2015 @11:02AM
(#10514055)
ASTs are DAGs indeed, but as soon as you add semantic information to the mix the graph usually becomes cyclic.
[ Parent
| on HN ]
There are no comments on this comment yet.