Issue: Add efficient sorted-vector intersection size counter for performance-critical neighbor counting
Issue: Add efficient sorted-vector intersection size counter for performance-critical neighbor counting: a task in LegoFlow-SWE (Harbor dataset). igraph ecc() and similar routines that require counting common neighbors between vertex pairs currently rely on the general igraph vector intersect…
The task
`igraph_ecc()` and similar routines that require counting common neighbors between vertex pairs currently rely on the general `igraph_vector_intersect_sorted()` function. This function builds the entire intersection of two sorted vectors. When only the **count** of common elements is needed, allocating and filling a…
Part of Lego-X/LegoFlow-SWE.