[Jung-support] [jung - Open Discussion] RE: Merging graphs

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

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

Pablo:

Quick question: why are you calculating the unions the way you are?  It looks
like you're doing

d_v = [anything in either A or B but not both]
i_v = [anything in both A and B]
u_v = [anything in either d_v or i_v]

and I don't see what good the disjunctions/intersections do you: you could just
calculate u_v as [A union B].  Or am I missing something?

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