recategorized by
1,613 views

1 Answer

Best answer
13 votes
13 votes

An adjacency list is an array $A$ of separate lists.

Each element of the array $A_{i}$ is a list, which contains all the vertices that are adjacent to vertex $i$.

  • $A_{1}\rightarrow2\rightarrow3\rightarrow5$
  • $A_{2}\rightarrow1\rightarrow3$
  • $A_{3}\rightarrow1\rightarrow2\rightarrow4\rightarrow5$
  • $A_{4}\rightarrow3\rightarrow5$
  • $A_{5}\rightarrow1\rightarrow3\rightarrow4$
edited by

Related questions

15 votes
15 votes
3 answers
1
makhdoom ghaya asked Nov 14, 2016
1,794 views
Show that the number of odd-degree vertices in a finite graph is even.
2 votes
2 votes
2 answers
2
makhdoom ghaya asked Nov 9, 2016
907 views
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
4 votes
4 votes
1 answer
3
makhdoom ghaya asked Nov 9, 2016
1,311 views
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
28 votes
28 votes
3 answers
4
makhdoom ghaya asked Nov 15, 2016
4,175 views
The Boolean expression $A \oplus B \oplus A$ is equivalent to$AB + \overline {A}\;\;\overline B$$\overline{A}\;B+A\;\overline{B}$$B$$\overline{A}$