I’m getting this error:

```
For the graph starting at node 0, the target path distance to beat is 3855. Your algorithm returned a distance of 3798, greater than 76%
```

This seems to suggest that the implementation is doing better than the target, but this is flagged as an error.

I suppose this is an algorithm that finds the minimum distance from a node to another node (can you point exactly which Lab is this) like Djikstras algorithm.

If that is so, your distance is bigger, so its doing worse than the minimum expectation of 3855!

https:// www.coursera. org / learn /introduction-to-generative-ai-for-software-development/programming/AtWBs/implementing-algorithms-in-graphs/lab

Yes because you are supposed to find the shortest path! That means your solutions are not right!

Hello,

Thank you for bringing this issue to our attention. You were correct; there was an error in the calculation. We apologize for any inconvenience this may have caused. The corrected version of the autograder has been updated and is now available. Please try resubmitting your solution. If you encounter any further issues, please let me know.

Thank you! All works now.

Seem to still get the same error?

Expected: Solution no greater than 76% of Nearest Neighbor.

Got: For the graph starting at node 0, the target path distance to beat is 3855. Your algorithm returned a distance of 3855, greater than 76%.

Nevermind. Had to refresh the lab.

1 Like

Havent done this course yet, I will have to go through it one of these days!