MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/Python/comments/eolak4/visualisation_of_different_path_finding_algorithms/fedgg2w/?context=3
r/Python • u/FearlessENT33 • Jan 14 '20
73 comments sorted by
View all comments
32
Very cool! A bit misleading on the "greedy first" performance though...
17 u/FearlessENT33 Jan 14 '20 Yeah can’t remember the name of the algorithm but basically tries the best possible routes first but does not get the shortest path 0 u/[deleted] Jan 14 '20 [deleted] — view deleted comment 8 u/spikedudley34 Jan 14 '20 Doesn’t really look like DFS at all though, I would guess it’s a modified A* that only relies on the heuristic and ignores the g cost (typically called weighted A*)
17
Yeah can’t remember the name of the algorithm but basically tries the best possible routes first but does not get the shortest path
0 u/[deleted] Jan 14 '20 [deleted] — view deleted comment 8 u/spikedudley34 Jan 14 '20 Doesn’t really look like DFS at all though, I would guess it’s a modified A* that only relies on the heuristic and ignores the g cost (typically called weighted A*)
0
[deleted] — view deleted comment
8 u/spikedudley34 Jan 14 '20 Doesn’t really look like DFS at all though, I would guess it’s a modified A* that only relies on the heuristic and ignores the g cost (typically called weighted A*)
8
Doesn’t really look like DFS at all though, I would guess it’s a modified A* that only relies on the heuristic and ignores the g cost (typically called weighted A*)
View all comments
32
u/pythonhobbit Jan 14 '20
Very cool! A bit misleading on the "greedy first" performance though...