Currently, the vertex table is not accessed when neither vertex attributes nor vertex where conditions are specified. This creates problems when auto-assigning ids (from 1 to vertex count) to vertices in a graph.
If we change computeGraph to always select vertices and order them by their names then id-ing vertices becomes consistent across all graph operations. In particular, this helps with clustering graphs and complying with standard community class objects (package igraph) when assigning vertex membership (and its membership element).
Currently, the vertex table is not accessed when neither vertex attributes nor vertex
where
conditions are specified. This creates problems when auto-assigning ids (from 1 to vertex count) to vertices in a graph.If we change
computeGraph
to always select vertices and order them by their names thenid
-ing vertices becomes consistent across all graph operations. In particular, this helps with clustering graphs and complying with standardcommunity
class objects (packageigraph
) when assigning vertex membership (and itsmembership
element).35 is related to this.