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
igraph_community_eb_get_merges() should have a name that does not associate it with igraph_community_edge_betweenness(). This function is useful in general scenarios where a sequence of edges is removed.
The text was updated successfully, but these errors were encountered:
Not sure about this; in theory, the function could be useful, but it needs to be generalized in several ways in order to make it really flexible, and I'm not sure it should be a priority for 1.0. In particular, the function should support
processing edge sequences starting from the entire graph, removing edges one by one according to the sequence, or
processing edge sequences starting from the empty graph, adding edges one by onw
We should also make sure that the function handles partial edge sequences well, i.e. cases when not all edges of the graph are enumerated in the edge sequence. We would also need checks for duplicate edge IDs and so on. The current function does not cater for these cases I think because it's designed only to handle the output of the edge betweenness algorithm where you know that edges are removed one by one and that all of them are removed in the end.
Alright, then let's remove this from the milestone. If needed, we can add a more flexible alternative with a new name in the future, and deprecate this one.
igraph_community_eb_get_merges()
should have a name that does not associate it withigraph_community_edge_betweenness()
. This function is useful in general scenarios where a sequence of edges is removed.The text was updated successfully, but these errors were encountered: