Graphs use both key and slice notation to refer to nodes and edges, respectively.
This works for both assignment and lookup of the respective value.
A node is written directly.
Its value is the adjacency associated with the node in the graph,
i.e. a mapping to all neighbours and the respective edge value.
An edge is written using slice notation.
Its value is the edge value associated with the edge in the graph.