Run static Label Propagation for detecting communities in networks.
the edge attribute type (not used in the computation)
the graph for which to compute the community affiliation
the number of supersteps of LPA to be performed. Because this is a static implementation, the algorithm will run for exactly this many supersteps.
a graph with vertex attributes containing the label of community affiliation