dsa2 min read
A* Search — Heuristic Shortest Path for Grid Problems
A* combines Dijkstra's correctness with a heuristic to guide search toward the goal. Uses f(n)=g(n)+h(n) priority. Optimal when heuristic is admissible.
Read →
All Posts
1575 articles
dsa2 min read
Topological Sort — Advanced Applications (DFS, Kahn, Cycle Detection)
Advanced topological sort: DFS-based with 3-color marking for cycle detection, Kahn's BFS approach, and applications in course scheduling, build systems, and task ordering.
Read →
dsa2 min read
Dijkstra Advanced — Modified Dijkstra Patterns (K Stops, States, Constraints)
Advanced Dijkstra patterns: state-space Dijkstra for problems with extra constraints like K stops, fuel limit, or restricted nodes. The key is augmenting the state beyond just the node.
Read →
dsa1 min read
Graph Coloring and Bipartite Check
Check if a graph is bipartite using BFS 2-coloring. A graph is bipartite if and only if it contains no odd-length cycles — equivalent to being 2-colorable.
Read →
dsa1 min read
Minimum Cost to Connect All Points — Prim's on Complete Graph
Connect all n points with minimum total Manhattan distance cost. Models the problem as a complete graph MST and applies optimised Prim's without building all O(n²) edges explicitly.
Read →
Page 288 of 315