25 Sep
2015
25 Sep
'15
1:51 p.m.
Hi, given a graph G and a subgraph S of G (computed using GraphView). What is the best way to check if a vertex v in V(G) is also in V(S). Is there are better way than iterating over all vertices in S? Best regards Chris