C1_M3_Exercise 4.1: shortest_path

Hello all,

I’m having trouble getting out the gate with the first exercise. I’m getting the error shown below in the screen capture:

I verified independently that both of the nodes (654, 114) are present. So, I’m a little bit lost as to what to do. Any thoughts or suggestions would be appreciated.

Cheers

Have you hardcoded anything in the solution?

Why don’t you try to feed this error to the solution the LLM gave you for this exercise?

Thank you for the response!

At this level, I would imagine any code is fluid and not immutable? I did try working with the LLM and applied the suggestions with success. However, the error show up when I sent run the cell containing “unittests.test_shortest_path(GraphShortestPath)” to check the code.

Cheers

Are you still getting that error, if so, send me a copy of your implementation in a private message.

Sent. Thank you!