Build an Adjacency List to Matrix Converter - is example valid?

Curriculum Help
1

In the instructions for this lab the following appears:

For example, given the adjacency list:
{
  0: [1, 2],
  1: [2],
  2: [0, 3],
  3: [2]
}

Is this a valid adjacency list? It appears to me to be saying

  • node 0 is linked to node 1 and node 2
  • node 1 is linked to node 2 – no mention of node 0
  • node 2 is linked to node 0 and node 3 – no mention of node 1
  • node 3 is linked to node 2

Please advise

Lesson URL:

2

this is a directional matrix, there is a node that goes from 0 to 2, but not from 2 to 0

User story 2 say

The function should take an object representing the adjacency list of an unweighted (either undirected or directed) graph as its argument.

This is an example of a directed graph