I would like to use Spark/graphx implementation of Louvain modularity algorithm. https://github.com/Sotera/spark-distributed-louvain-modularity
Is there a way to apply it on a graph with weighted edges?
It seems that an input file can contain 2 or 3 columns. If it is 2, then the first one is the source and the second is the destination. What is the third column? Weights?