CS - Roadmap.sh/3. Common Algorithms(32)
-
3.7.2 In-Order Traversal(중위 순회)
CS - 3. Common Algorithms - 3.7 Tree - 3.7.2 In-Order Traversal In-Order Traversal 💡In-order traversal is a tree traversal algorithm that visits the left subtree, the root, and then the right subtree. This is the most common way to traverse a binary search tree. It is also used to create a sorted list of nodes in a binary search tree. 중위 순회(Inorder Traversal)은 왼쪽 하위 트리, 루트, 오른쪽 하위 트리를 차례로 방문하는 트..
2024.02.09 -
3.7.1 Pre-Order Traversal(전위 순회)
CS - 3. Common Algorithms - 3.7 Tree - 3.7.1 Pre-Order Traversal Tree Algorithms 💡A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value and a list of references to other nodes (the “children”). 트리는 비선형적이며 노드 모음으로 구성된 계층적 데이터 구조로, 트리의 각 노드가 값과 다른 노드에 대한 참조 목록("자식")을 저장합니다. Pre-Order Traversal 💡Pre-order traversal ..
2024.02.08 -
3.6.4 Prim’s Algorithm (프림 알고리즘)
CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.4 Prim's algorithm Prim’s Algorithm 💡 Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a weighted undirected graph. A minimum spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge ..
2024.02.07 -
3.6.3 Ford Fulkerson algorithm(폴드풀커슨 알고리즘)
CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.3 Ford Fulkerson algorithm Ford Fulkerson Algorithm 💡Ford Fulkerson Algorithm is a greedy algorithm that is used to find the maximum flow in a flow network. It is also known as the Edmonds-Karp Algorithm. 포드 풀커슨 알고리즘은 흐름 네트워크에서 최대 흐름을 찾는 데 사용되는 탐욕 알고리즘입니다. 에드먼즈-카프 알고리즘이라고도 합니다. 포드-풀커슨(Ford-Fulkerson) 알고리즘은 네트워크 플로우 문제를 해결하기 위한 방법 중 하나입니다. 이..
2024.02.06 -
3.6.2 Kruskal’s algorithm (크루스칼 알고리즘)
CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.2 Kruskal's algorithm Kruskal’s algorithm 💡Kruskal’s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted graph. It is a minimum spanning tree algorithm that takes a graph as input and finds the subset of the edges of that graph which form a tree that includes every vertex, where the total weight of al..
2024.02.05 -
3.6 Greedy Algorithms - 3.6.1 Huffman Coding
CS - 3. Common Algorithms - 3.6 Greedy Algorithms - 3.6.1 Huffman Coding Huffman Coding 💡Huffman coding is a lossless data compression algorithm. The idea is to assign variable-length codes to input characters, lengths of the assigned codes are based on the frequencies of corresponding characters. The most frequent character gets the smallest code and the least frequent character gets the larges..
2024.02.03