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 ..

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) 알고리즘은 네트워크 플로우 문제를 해결하기 위한 방법 중 하나입니다. 이..

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..

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..

CS - 3. Common Algorithms - 3.6 Greedy Algorithms Greedy Algorithms 💡Greedy algorithms are a type of algorithm that always makes the choice that seems to be the best at that moment. This means that it makes a locally-optimal choice in the hope that this choice will lead to a globally-optimal solution. 욕심 알고리즘은 항상 그 순간에 최선인 것처럼 보이는 선택을 하는 알고리즘의 한 유형입니다. 즉, 이 선택이 전 세계적으로 최적의 솔루션으로 이어지기를 바라며 국지적으로 ..

CS - 3. Common Algorithms - 3.5 Graph - 3.5.5 A* Algorithm A* Algorithm 💡 A* is a graph traversal algorithm that is used to find the shortest path between two nodes in a graph. It is a modified version of Dijkstra’s algorithm that uses heuristics to find the shortest path. It is used in pathfinding and graph traversal. A*는 그래프에서 두 노드 사이의 최단 경로를 찾는 데 사용되는 그래프 탐색 알고리즘입니다. 이는 휴리스틱을 사용하여 최단 경로를 찾는 D..