Week3 Assignment - tsp_small_graph() unit test is failing, tried bunch of options. doesn't seem to work

Failed test case: Exceeded time execution limit for a tour starting in node 0. To replicate the graph, you may run generate_graph(nodes = 10, complete = True, seed = 42).
Expected: shortest_path method must run in less than 1 seconds
Got: Time execution exceeded 1 seconds

Failed test case: Exceeded time execution limit for a tour starting in node 0. To replicate the graph, you may run generate_graph(nodes = 10, complete = True, seed = 43).
Expected: shortest_path method must run in less than 1 seconds
Got: Time execution exceeded 1 seconds

Failed test case: Exceeded time execution limit for a tour starting in node 0. To replicate the graph, you may run generate_graph(nodes = 10, complete = True, seed = 44).
Expected: shortest_path method must run in less than 1 seconds
Got: Time execution exceeded 1 seconds

1 Like

Try asking the GPT to provide a more efficient solution to the algorithm!

Same issue here , any pointers?

Hi,
I am new to LLM and this community.
Could you please guide me on how to start with the assignment related to graph.
I am very much confused on the start point.
I do understand the importance of prompts but, currently all seems a challenge.
Looking forward for guidance.

Try asking the LLM to give you different implementations of the TSP problem and try to implement them in your Lab and see what the grader says about them!

I guess you have to start reading the instructions step by step and then asking the LLM the questions you have and these might include understanding even fragments of the code, that how I would go about it. Even simple naive questions just ask and try to understand, you should be open minded to learn, thats the most important thing!

1 Like

I agree. I tried to use this approach and was able to pass the tests on my third attempt. It’s more about following the instructions. Prompting LLM by applying the techniques taught throughout the course.

1 Like

Thanks i did work.

1 Like