Generate a grouped network by edge betweenness from a preprocessed coherent network
coherent_network_group.Rd
This function takes a preprocessed network and applies graph-based analysis to group the network edges based on their betweenness centrality. The function assumes that the input network has attributes relevant to cycling traffic dynamics, specifically 'all_fastest_bicycle_go_dutch' and 'weight'. It outputs a transformed network where edges are grouped and ranked according to their mean potential, facilitating further analysis or visualization of critical network pathways.
Usage
coherent_network_group(
coherent_network,
key_attribute = "all_fastest_bicycle_go_dutch",
n_group = 12
)