Posts tagged with

Graphs

Understand Dijkstra's algorithm for shortest path in a weighted graph and topological sort for ordering tasks with dependencies. Be aware of algorithms like A* and Prim's/Kruskal's for Minimum Spanning Trees.

Understand adjacency list vs. adjacency matrix representations and their trade-offs. Be proficient in Breadth-First Search (BFS) for shortest path in unweighted graphs and Depth-First Search (DFS) for traversal and cycle detection.