[Algorithm] Minimum Spanning Tree(MST) Problem : Cut, Prim’s, Kruskal’s
Spanning Tree : 모든 vertex를 포함하고, undirected이며, cycle이 없는(Tree) SubGraph MST : total weight가 가장 작은 spanning tree ...
최근 포스트
[Algorithm] 자료구조2 : BST, RBT (1)
BST (Binary Search Tree)
[Algorithm] Graph Search : BFS, DFS
BFS : Breadth First Search 넓이 우선 탐색
[Algorithm] Algorithm Complexity
input size가 아주 커질 때 가정(n→ $\infin$) notation $O$ : Upper Bound, Worst Case O(g(n)) =...