Organizing several similar classes with overlapping variables

[6hearts]

Oh, sorry, so I would keep the nodes in a dictionary, but each node is a list.
So the class graph would have a variable nodes what would be a dictionary, each node is a represented as a list, seqence of adjacent nodes.
For example, we would have a member

class graph:
    def add_node(node: Hashable, adjacent_nodes: list):
        self._nodes[node] = adjacent_nodes 

The difference between them would eg. be that on nodes, we can permute the adjacent nodes (they then could be sets, not lists), on vertices we could only do cyclic permutations, on points we could, for example, split them in two. split_point([1,2,3,4]) would return ([1,2],[3,4]), but such operations would nor be logical for vertices. Also, when plotting, they would look different.

I think subclassing would do the trick, have a class Node, a class Vertex(Node), class Point(Node),...
and then then just store these as dictionary items, so self._nodes = {"a":node1, "b":vertex1, "c":vertex2,...}

But the downsides are:

1. I would need filters for accessing only vertices or only points on a graph that has mixed nodes
   
2. I could not easily count the number of vertices, since I would have to iterate over the dict
   
3. I would not have a classes such as VertexGraph and PointGraph, since they would all be mixed inside the dict.
   

What about if I made a custom dictionary class that would allow the keys to be partitioned, so I could kida initialize it by

nodes = my_dict(categories=("vertices", "points",..))

and then i could iterate over all nodes, or nodes.vertices, nodes.points,...