24 Jun
2018
24 Jun
'18
11:23 a.m.
Am 21.06.2018 um 17:40 schrieb P-M:
Hello,
If I try to filter a graph by passing a list of vertices in an ndarray as argument to GraphView is the complexity proportional to the number of vertices in the overall graph or the number of vertices in my array?
That is not how GraphView works. It requires a vertex/edge mask or a filter function. In the former case it is O(1), in the latter O(N) or O(E). Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>