This is something like transforming a sparse matrix into a dense matrix as we usually do in the matrix compression.
dyzz
As we can see this form of graph representation is very space inefficient. Every vertex must specify all of its incoming and outgoing edges, thus duplicating information in two different areas. This will optimize for large memory/low compute systems as we have all the information we could need in front of us, however this takes a lot of space.
This is something like transforming a sparse matrix into a dense matrix as we usually do in the matrix compression.
As we can see this form of graph representation is very space inefficient. Every vertex must specify all of its incoming and outgoing edges, thus duplicating information in two different areas. This will optimize for large memory/low compute systems as we have all the information we could need in front of us, however this takes a lot of space.