The function igraph are connected() is ambiguously named. In graph theory, “connected” can mean either that…
The function igraph are connected() is ambiguously named. In graph theory, “connected” can mean either that…: a task in LegoFlow-SWE (Harbor dataset). We need a new public function igraph are adjacent() that unambiguously checks whether there is a direct edge between two vertices. The original…
The task
We need a new public function `igraph_are_adjacent()` that unambiguously checks whether there is a direct edge between two vertices. The original `igraph_are_connected()` should be deprecated but kept available for backward compatibility, so existing code that calls the old name still links (presumably with a…
Part of Lego-X/LegoFlow-SWE.