Hi All,

 

I’m working in [FLINK-1707] implementing Binary Affinity Propagation for Gelly, 
and I need to do a transformation from the input graph to the one to be used 
for the algorithm. 

 

The input graph is a similarity graph and the one for the implementation 
doubles the vertices as it needs two different types of vertex for each point 
to be clustered. Diagrams fo the origin and final graphs can be found in the 
design document 
(https://docs.google.com/document/d/1QULalzPqMVICi8jRVs3S0n39pell2ZVc7RNemz_SGA4/edit?usp=sharing)
 section 3.1.

 
I’ve done the transformation with gelly function groupReduceOnEdges to create 
the vertices and a loop to create the edges, and although it works it does not 
seem to be the best way to do it L. Could someone give me some tips on how to 
do this transformation?
 
Thanks in advance!
 

 

Reply via email to