Hi, I’m looking for a way to define graph with weighted connection between edges which will be then used by "Community label propagation” function.
There are 3 use-cases: * 2 edges are definitely not connected * 2 edges are definitely connected * 2 edges may be connected with certain probability What is the best way to define this in igraph so that community label propagation function will take that in consideration in clustering? Small example will really help. Thanks a lot for your support Jozef _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
