Home › Per Red Blob Games, DIJKSTRA's algorithm extends…
Per Red Blob Games, DIJKSTRA's algorithm extends BFS to handle which kind of graph?
ABidirectional graphs of nodes only
BSparse adjacency-list graphs only
CDirected acyclic graphs of nodes only
DWeighted graphs with non-negative costs
Answer & Solution
Correct answer: D. Weighted graphs with non-negative costs
Red Blob Games Dijkstra: like BFS but with a priority queue sorted by cumulative cost g. Requires non-negative weights.
Related questions
Per Red Blob Games (movement costs), if some terrain costs MORE to traverse, Dijkstra's alPer Reynolds' Steering Behaviors (commonly cited in game AI), 'SEEK' behaviour produces whIn game AI, a BEHAVIOR TREE typically uses which TWO compositional node types?In game AI design, a FINITE STATE MACHINE (FSM) is best suited for modelling which?In standard game AI literature, a NavMesh (navigation mesh) represents walkable terrain asPer Red Blob Games (Map Representations), a HEX grid offers which advantage over a square Per Red Blob Games, an ADMISSIBLE heuristic h(n) satisfies which property?Per Red Blob Games, for an 8-direction grid (with diagonals at √2 cost), the recommended h