Open aroonalok opened 2 years ago
In the section The challenges of using graphs in machine learning, a paragraph starts with the sentence:
One elegant and memory-efficient way of representing sparse matrices is as adjacency lists.
From the representation described later, it is clear that an Edge List representation of the graph is meant.
Also from the side text:
Another way of stating this is with Big-O notation, it is preferable to have 𝑂(𝑛𝑒𝑑𝑔𝑒𝑠), rather than 𝑂(𝑛2𝑛𝑜𝑑𝑒𝑠).
It is confirmed that the Edge List representation is meant here as an Adjacency List representation takes O(V+E) space.
In the section The challenges of using graphs in machine learning, a paragraph starts with the sentence:
From the representation described later, it is clear that an Edge List representation of the graph is meant.
Also from the side text:
It is confirmed that the Edge List representation is meant here as an Adjacency List representation takes O(V+E) space.