Currently, the empty graphs do contain all 101 nodes, however, no edges exist. Well they do exist, but are initialized to 0. The current node2vec implementation still considers all 101 nodes even if a card hasn't been used at all. Therefore, node2vec still considers these nodes in the random walk
Adding a new node to the network each time might be expensive. They should be initialized, but only to consider nodes with at least one true edge weight, i.e. a weight greater than the initialized 'usages' = 0
Currently, the empty graphs do contain all 101 nodes, however, no edges exist. Well they do exist, but are initialized to 0. The current node2vec implementation still considers all 101 nodes even if a card hasn't been used at all. Therefore, node2vec still considers these nodes in the random walk
Adding a new node to the network each time might be expensive. They should be initialized, but only to consider nodes with at least one true edge weight, i.e. a weight greater than the initialized
'usages' = 0