알고리즘

"Sequence of locally optimal choices"Greedy algorithms don't always yield globally optimal solutions, but are usually the simplest and most efficient

Used for optimization problems - can find optimal solutions when Greedy failsMain Idea: recursively define the value of an optimal solution using smal

Vertex (정점)Edge (간선)Weight (가중치)Undirected graph (무방향 그래프)