2. Introduction
Take a look at this two simple graphs. I used rectangles to
separate the graphs. Two graphs: «Graph A» and «Graph B».
a0 a1
Graph A Graph B
b1
b0
b2
3. Introduction
The first graph with name
«Graph A» consists of
vertices
«a0», «a1»
edge
«a0» ---> «a1»
a0 a1
Graph A
17. Implementation
At least two helper classes: Encoder & Decoder.
Encoder encode Graph class instance to save in ^Graphs.
Decoder decode Graph class instance to load from ^Graphs.
Graph class represents graph model with vertices and edges.