See all igraph's items
A node in the graph is identified by the key.
Keys are stored in the order they were inserted, a redundant copy is stored in the index.
Values don’t have this redundancy.
There could be more than one values for a key.