Algorithms

Data Structures

• Binary Heap - a binary tree that obeys heap properties.

Graphs

• Breadth First Search - graph search that looks at all nearby vertices before moving farther out.
• Depth First Search - graph search that follows paths to the edge of the graph and backtracks.
• Prim's Minimum Spanning Tree - finds a minimum spanning tree for a connected graph.

Shortest Paths

• Shortest path in a DAG - simple algorithm for finding the shortest path in a directed acyclic graph.
• Djikstra's - finds the shortest path in a directed graph where all edge weights must be non-negative.
• Bellman-Ford - where possible, finds the shortest path in a graph that contains negative cycles.

Problem solving approaches

• Dynamic Programming