The library currently lacks a function to compute the k‑trussness of edges in an undirected graph. The…
The library currently lacks a function to compute the k‑trussness of edges in an undirected graph. The…: a task in LegoFlow-SWE (Harbor dataset). We need a new public function igraph trussness() that takes an undirected graph as input and returns a vector of trussness values, one for each edge…
The task
We need a new public function `igraph_trussness()` that takes an undirected graph as input and returns a vector of trussness values, one for each edge. The trussness of edge e is the maximum k such that e is part of a k‑truss. For edges that are not in any triangle, the trussness should be 2. Self‑loops (edges from a…
Part of Lego-X/LegoFlow-SWE.