freeCodeCamp/curriculum/challenges/german/07-scientific-computing-with-python/learn-algorithm-design-by-building-a-shortest-path-algorithm/6579dd49fa8a8e1fd06b85a9.md

id, title, challengeType, dashedName

id	title	challengeType	dashedName
6579dd49fa8a8e1fd06b85a9	Step 11	20	step-11

--description--

Graphs are data structures representing relations between pairs of elements. These elements, called nodes, can be real-life objects, entities, points in space or others. The connections between the nodes are called the edges.

For example, a graph can be used to represent two points in the space, A and B, connected by a path. A graph like this will be made of two nodes connected by an edge.

Rename the copper dictionary into my_graph. This will represent the graph to test your algorithm.

--hints--

You should rename your copper dictionary into my_graph.

({ test: () => assert(__userGlobals.has("my_graph")) })

Your my_graph variable should be a dictionary.

({ test: () => assert(__pyodide.runPython(`
    my_graph = __locals.get("my_graph")
    type(my_graph) is dict 
  `))
})

--seed--

--seed-contents--

--fcc-editable-region--
copper = {
    'species': 'guinea pig',
    'age': 2
}
--fcc-editable-region--