You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Apr 22, 2020. It is now read-only.
| Name | Type | Description |
+ ------+------+---------------+
| nodeId | int | Node ID |
| label | int | Community ID |
In complex graphs, I don't know which edges are truly responsible for connecting the community. As a feature request, I'd like to suggest returning triplets (node1)-edge1-(node2). Or maybe that is just 'not a thing' in community detection?
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hey there. I've been using LPA community detection for a few months now.
As seen in 6.21 there are no edges returned.
https://neo4j.com/docs/graph-algorithms/current/algorithms/label-propagation/
In complex graphs, I don't know which edges are truly responsible for connecting the community. As a feature request, I'd like to suggest returning triplets
(node1)-edge1-(node2)
. Or maybe that is just 'not a thing' in community detection?The text was updated successfully, but these errors were encountered: