91.5k views
2 votes
7. While an adjacency matrix is typically easier to code than an adjacency list, it is not always a better solution. Explain when an adjacency list is a clear winner in the efficiency of your algorithm

User Chirlu
by
8.5k points

1 Answer

5 votes

Answer:

The answer is below

Step-by-step explanation:

Adjacency list is a technique in a computer science that is used for representing graph. It deals with a gathering of unorganized lists utilized to illustrate a limited graph. In this method, each list depicts the group of data of a peak in the graph

Adjacency List are most preferred to Adjacency Matrix in some cases which are:

1. When the graph to is required to be sparsely.

2. For iterability, Adjacent List is more preferable

User Slmyers
by
8.4k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.