From: SourceForge.net <no...@so...> - 2004-08-31 07:10:34
|
Read and respond to this message at: https://sourceforge.net/forum/message.php?msg_id=2736902 By: nobody I'm running in to some problems with graphstatistics - hopefully someone here can give me some ideas. 1. How do I get the averagedistances for a directed graph with multiple weakly components? The path length is infinite for some vertex pairs so it returns null - is there any way to get around this and just get the distances for connected pairs? 2. Is it possible to get the clustering coefficient of a directed graph and just disregard direction? I can't cast like this: DoubleArrayList L = GraphStatistics.clusteringCoefficients((UndirectedGraph)g); if g is DirectedSparseGraph? Thank you in advance, Fernando Dena ______________________________________________________________________ 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 |