More sane check if two graph represent same computations.
The main thing I was looking for was efficiency. The new algorithm
is not recursive, it considers a bunch of outputs at the same time,
and it uses toposort to traverse the graph, making sure each node is seen
only once.
正在显示
请
注册
或者
登录
后发表评论