From: SourceForge.net <no...@so...> - 2008-09-28 21:16:59
|
Read and respond to this message at: https://sourceforge.net/forum/message.php?msg_id=5339203 By: nima3 Actually i did my own implementation and now i am trying to modify it to meet the JUNG standards. the first problem is algorithm in each step use the previous result of different things, i mean if we are going to score i and j , we need the scores of a pair m,n when m and n are a pair of neighbours of i and j. It means that we need a class to represent a pair and also a map to keep a pair and it' score. In this way it can't be implemented on iterative scorer. Also i think it should be defined in a way to score all pair of node since the algorithm is using previous results in this way. Regards. Nima ______________________________________________________________________ You are receiving this email because you elected to monitor this forum. To stop monitoring this forum, login to SourceForge.net and visit: https://sourceforge.net/forum/unmonitor.php?forum_id=252062 |