[Jung-support] [jung - Open Discussion] RE: 2 (easy?) questions

[SourceForge.net <no...@so...>]

Read and respond to this message at: 
https://sourceforge.net/forum/message.php?msg_id=2737885
By: e-flat

Fernando:

(1) Here are two ways of coping with this:
(a) put a test in that ignores the "null" values (I may consider changing this
code to optionally do this, but it should be an easy fix on your end).
(b) identify the weakly connected components (via WeakComponentCluster), convert
these clusters into graphs, calculate the average distances for each of these,
and then take the (weighted) average of these averages to get the overall
average.

(2) You can create an undirected version of a directed graph (or vice versa)
using the algorithms.transformation.DirectionTransformer class.  (You are correct
that you can't simply cast a directed graph to undirected and vice versa.)

Regards,

Joshua

______________________________________________________________________
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