freeCodeCamp/curriculum/challenges/arabic/07-scientific-computing-with-python/learn-algorithm-design-by-building-a-shortest-path-algorithm/65affe602a2a828b0382a058.md

id, title, challengeType, dashedName

id	title	challengeType	dashedName
65affe602a2a828b0382a058	Step 17	20	step-17

--description--

Replace the 'age' key with the string 'B' and set its value to the string 'A' to represent the connection between the nodes in both directions.

--hints--

Your dictionary should have a 'B' key.

({ test: () => assert(runPython(`
    "B" in my_graph
  `))
})

Your 'B' key should have 'A' as the value.

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

Your dictionary should have an 'A' key.

({ test: () => assert(runPython(`
    "A" in my_graph
  `))
})

Your 'A' key should have 'B' as the value.

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

Your dictionary should have two keys.

({ test: () => assert(runPython(`
    len(my_graph) == 2
  `))
})

--seed--

--seed-contents--

--fcc-editable-region--
my_graph = {
    'A': 'B',
    'age': 2
}
--fcc-editable-region--