Data Structure(graph)

A. Graph data structures are non-hierarchical or not inordered and therefore suitable for data sets where the each elements are interconnected in many ways. For example,a computer network can be modeled with graph.
We are assigned to show how graph, store data. A tree data structure can be considered as a special form of a graph data structure(acyclic). A graph is composed of nodes where the data are placed. A tree is a graph in which any two vertices are connected by exactly one path.
Data Value_1
Data Value_2
Data Value_3
Data Value_4
Data Value_5
Data Value_6

B. Figure Sample: