Notes
This function is in beta test. Please help improve it in the issues
here.
Hints
Your answer may be identical to the JOJ answer in the first several lines.
However, you will still get Wrong Answer because the complete output may be longer and there might be errors in the future lines.
Please double check your code to solve this problem and try again.
Your Answer
*** FAIL: ./test_cases/q1/graph_bfs_vs_dfs.test *** graph: *** /-- B *** | ^ *** | | *** | *A -->[G] *** | | ^ *** | V | *** \-->D ----/ *** *** A is the start state, G is the goal. Arrows *** mark possible transitions *** student solution: ['2:A->D', '0:D->G'] *** student expanded_states: ['A', 'D', 'G'] *** *** correct solution: ['2:A->D', '0:D->G'] *** correct expanded_states: ['A', 'D'] *** correct rev_solution: ['0:A->B', '0:B->D', '0:D->G'] *** correct rev_expanded_states: ['A', 'B', 'D']
JOJ Answer
*** PASS: ./test_cases/q1/graph_bfs_vs_dfs.test