Key Resolving Conception

https://github.com/diariesofijon/GraphExplorer/blob/1cb5af5a6130be22244be72113c999f4a3173563/data_structures.py#L26
Endicate the biggest count of Vertexs from already defined number to the most available variant of the graph. When the graph have the maximum lenght of the chain and still meets definition of a graph. Also it have opportunity to choose the best variant of the graph through any interface by switching from one numirical set of variables of the graph to another. like this
1.
MaxVertexConut = 2
Edges = 7
Depth = 2
2.
MaxVertexConut = 5
Edges = 3
Depth = 4
3.
MaxVertexConut = 10
Edges = 2
Depth = 5
4.
MaxVertexConut = 12
Edges = 1
Depth = 9
5.
MaxVertexConut = 12
Edges = 2
Depth = 7