in Graph Theory recategorized by
1,621 views
11 votes
11 votes

Specify an adjacency-lists representation of the undirected graph given above.

in Graph Theory recategorized by
1.6k views

1 Answer

13 votes
13 votes
Best answer

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

1 comment

order doesn’t matter!
0
0

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true