Enhanced implementation techniques
An adjacency list is an easy and effective way to implement a graph in memory. However, just like adjacency matrices, some more complicated use cases cannot be implemented with the most basic implementation of adjacency lists.
Adjacency list implementation cannot store:
- Weighted edges
- Data value at nodes
Loading Image
Adjacency matrix cannot store graphs with edge weights and node data
Liking the course? Check our discounted plans to continue learning.