Tag: graphs
A* Pathfinding Algorithm
4
Heuristic search algorithm that finds the lowest-cost path using f(n)=g(n)+h(n), widely used in maps and game AI.
6mo ago
Algorithms advanced
Adjacency Matrix vs Adjacency List
1
Two ways to represent a graph — adjacency matrix (2D array, O(1) edge lookup, O(V²) space) vs adjacency list (array of lists, O(V+E) space, better for sparse graphs).
6mo ago
Data Structures intermediate