[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ์ž„๊ณ„ ๊ฒฝ๋กœ(Critical Path)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ๊ฐ•ํ•œ ์—ฐ๊ฒฐ ์š”์†Œ(Strongly Connected Component)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ๊นŠ์ด ์šฐ์„  ํƒ์ƒ‰(DFS)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ๋„ˆ๋น„ ์šฐ์„  ํƒ์ƒ‰(BFS)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ๋ฐฐ๋‚ญ ๋ฌธ์ œ(Knapsack Problem)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ํ—ˆํ”„๋งŒ ์ฝ”๋“œ(Huffman Code Problem)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ๊ทธ๋ฆฌ๋”” ์•Œ๊ณ ๋ฆฌ์ฆ˜(Greedy Alogorithm)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ์ตœ์žฅ ๊ณตํ†ต ๋ถ€๋ถ„ ์ˆ˜์—ด(LCS)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ํ–‰๋ ฌ ๊ณฑ์…ˆ ๋ฌธ์ œ (Matrix Chain Multiplication)
[์•Œ๊ณ ๋ฆฌ์ฆ˜ ์ •๋ฆฌ] ์ตœ์žฅ ์ฆ๊ฐ€ ๋ถ€๋ถ„ ์ˆ˜์—ด(LIS)