Sir, The graph-tool software allows to define layers for any network where each layer can have different kinds of interactions of the nodes. It is assumed that, number of edges are different in each layer but they are between the nodes which are from a common set.
My question is, after the graph partition has been done to find modules, does the partition algorithm considers the information from all the layers to generate a universal partition or it partitions each layer separately ? Also, if the tool partitions the network by considering the information from all layers then what edge information it stores finally, given that every layer had different edge information initially ? -- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/ _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
