I'm trying to create nodes representing each unique community, and create an edge between each particular node that belongs in community and the community node (basically, create a new Community node for each community ID found, and then add a MEMBER_OF relationship for each node with corresponding community ID).
I already ran the Louvain algorithm and assigned id for each community.
Is it possible somehow not to going through the entire graph in order to find all community id?
Or how to make it so that when the algorithm finds a new community id, it creates a new community node and creates MEMBER_OF relationship with all next corresponding nodes in community.?
I am a marketer, not a developer and therefore the question can be silly.