---
id: 6557712d77ce2d9bd7e63afd
title: Step 18
challengeType: 20
dashedName: step-18
---

# --description--

Add another node connected to `B` to your graph and call it `C`.

Modify your existing dictionary to represent this arrangement: add another key `'C'` to `my_graph` and give it the value of the string `'B'`.

Also, change the value of the existing `'B'` key into the list `['A', 'C']` to represent the multiple connections of your `'B'` node.

# --hints--

Your dictionary should have 3 keys — `'A'`, `'B'`, and `'C'`.

```js
({ test: () => assert(runPython(`
    key_list = ["A", "B", "C"]
    len(my_graph) == 3 and all(key in my_graph for key in key_list)
  `))
})
```

The value of `my_graph['A']` should be the string `'B'`.

```js
({ test: () => assert(runPython(`
    my_graph["A"] == "B"
  `))
})
```

`my_graph['B']` should be a list.

```js
({ test: () => assert(runPython(`
    type(my_graph["B"]) is list
  `))
})
```

The value of `my_graph['B']` should be a list containing `'A'` and `'C'`.

```js
({ test: () => assert(runPython(`
    len(my_graph["B"]) == 2 and "A" in my_graph["B"] and "C" in my_graph["B"]
  `))
})
```

The value of `my_graph['C']` should be the string `'B'`.

```js
({ test: () => assert(runPython(`
    my_graph["C"] == "B"
  `))
})
```

# --seed--

## --seed-contents--

```py
--fcc-editable-region--
my_graph = {
    'A': 'B',
    'B': 'A'
}
--fcc-editable-region--
```