Can we also use sequential storage structure on graph? There is no ascertained relation between nodes in a graph (no root, no starting node, end node), and there could be a connection between any two...

Can we also use sequential storage structure on graph?

There is no ascertained relation between nodes in a graph (no root, no starting node, end node), and there could be a connection between any two vertices. Therefore, we cannot use sequential structure to store both node data and the relation between the nodes. However, if we store the information about vertices and edges separately into separate sequential structures, then this should be possible.