_snap_eligible_group(G, groups, group_lookup, edge_types)
A group is eligible to be split if all nodes in the group have edges of the same type(s) with the same other groups.
graph to be summarized
A dictionary of unique group IDs and their corresponding node groups
dictionary of nodes and their current corresponding group ID
dictionary of edges in the graph and their corresponding attributes recognized in the summarization
Determines if a group is eligible to be split.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them