00:01
In this question, first we will write the advantages of using an adjacency matrix to represent a graph in a computer system.
00:19
So the first advantage is that they are efficient for dense graphs because they utilize memory efficiently when the number of edges is close to the maximum.
00:34
Now second advantage is direct edge lookup.
00:41
It allows for direct and constant time lookup of whether an edge exists between two nodes.
00:47
You can check the presence or absence of an edge in no time.
00:50
Third advantage is matrix operations.
00:55
Now if you need to perform matrix operations such as multiplication, exponentiation, it makes such operations straightforward and efficient.
01:06
And the next advantage is parallel processing.
01:11
In some cases, these matrices can be more suitable for parallel processing and numerical simulation because of the regular data structure.
01:18
So these are the advantages of adjacency matrix to represent a graph in a computer system.
01:25
Now we also have disadvantages of using an adjacency matrix to represent a graph in computer system.
01:36
So the first disadvantage is space complexity because they consume ob squared space where b is the number of vertices in graph...