Data Structure

Stack

Queue

Deque

Priority Queue

Heap

Linked List

Graph Theory

Graph Representation

Adjacency Matrix

Adjacency List

Graph Search

BFS (Breadth-First Search)

DFS (Depth-First Search)

Shortest Path

Dijkstra Algorithm

Bellman-Ford Algorithm

Floyd-Warshall Algorithm

DAG : Directed Acyclic Graph

Topological Sort

Critical Path

Disjoint-Set

Union-Find

SCC : Strongly Connected Component

Tarjan's Algorithm

Network Flow

Maximum Flow

Ford-Fulkerson Algorithm

Edmonds-karp Algorithm

Bipartite Matching

Max-flow Min-cut Theorem

Sorting Algorithm

Bubble Sort

Selection Sort

Insertion Sort

Shell Sort

Quick Sort

Searching

Linear Search (Sequential Search)

Binary Search

Tree

MST : Minimum Spanning Tree

Kruskal Algorithm

Binary Search Tree

Tree Traversal

Binary Search Tree

Prefix Sum

Segment Tree

Fenwick Tree

Solving Paradigms

Brute Force

Divide and Conquer

Greedy

DP (Dynamic Programming)

Math

Geometry

CCW (Counterclockwise)

Nuber Theory

Euclidean Algorithm

Else

Bit Masking

DP - LIS (Longest Increasing Subsequence)

TSP : Traveling Salesperson Problem

Segment Tree - Lazy Propagation

PS 기록

문제 정리의 사본