It's not a code, it's a graph where we have to find the shortest route from point to point using an algorithm.

its just a pdf file, scan it if you want to. I'm new here and didn't find a way to upload img Smallpdf.com[^]

We got an assignment where we have to find the shortest route between S and G and use the bfs, dfs, a* & dijkstra algorithms. I'm not sure I did the steps correctly, I'd love to know if I made a mistake and where. For example in dijksra, when I got to point T I didn't know exactly what to do, if it was possible to end the search and go straight to G, or as I did - go to D and then to G. Regarding the *A, I'm not at all sure that I did it right.. at least the table of steps.. I would appreciate your help. Pdf: Ex0[^]