Homework4::Extensions::(3rd)看不懂求助！

[Jack Ji]

原文如下

Extensions: (For the Fearless)

You're not expected to get this far, but if you are super-ambitious, you could try...

·         Write a pass that determines whether or not PageRank has converged, rather thanusing a fixed number of iterations(5 points )

·         Rewrite the program to support dangling node.(5 points bonus)

·         Implement the program without transfer all graph adjacency list data in the iterations.(10 points bonus)

我的理解是不用课上讲的那个先拆图再判断是否是节点的那个算法，换句话说是自己设计一个算法能够保证图结构的完整性。不知道我理解的对不对。我的问题是，这问不用考虑复杂度吧？

[苑斌]

同求问
在 2014年7月25日星期五UTC+8下午11时05分02秒，Jack Ji写道：

[PengBo]

是这个意思，而且是因为pseducode中图结构会shuffle，i/o开销大，
这个task希望找到i/o更优的方法。

--
You received this message because you are subscribed to the Google Groups "cs402pku" group.
To unsubscribe from this group and stop receiving emails from it, send an email to cs402pku+u...@googlegroups.com.
To post to this group, send email to cs40...@googlegroups.com.
Visit this group at http://groups.google.com/group/cs402pku.
For more options, visit https://groups.google.com/d/optout.