Dijkstra's algorithm is one fundamental algorithms for computing the shortest path in a network

[aleksihiltunen]

A* is just an extension of Dijkstras with heuristic so technically this algorithm is both but A* would be more precise description of this algo

[jakorev_racing]

AStar, not always optimal, but faster, in condition speed/time/result AStar is better, but if we have a lot of time, Dijkstra will be bettetr

[SamoraDc]

Thats not Dijkstra, it is A* (A- Star)

[schrodingerscat]

As uh can see the branches going towards the destination are faster than branches going out from source to other direction so it's not djiktras fully

[adityavsx]

Astar, dijkstra would j be a bfs w pq so that wont look liek this :/ this looks like aStar to me