CS - Roadmap.sh/3. Common Algorithms(32)
-
3.6 Greedy Algorithms
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. 욕심 알고리즘은 항상 그 순간에 최선인 것처럼 보이는 선택을 하는 알고리즘의 한 유형입니다. 즉, 이 선택이 전 세계적으로 최적의 솔루션으로 이어지기를 바라며 국지적으로 ..
2024.02.02 -
3.5 Graph - 3.5.5 A* Algorithm
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..
2024.01.31 -
3.5 Graph - 3.5.4 Dijkstra’s Algorithm
CS - 3. Common Algorithms - 3.5 Graph - 3.5.4 Dijkstra's Algorithm Dijkstra’s Algorithm 💡Dijkstra’s algorithm is a graph traversal algorithm that finds the shortest path between two nodes in a graph. It is a weighted graph algorithm, meaning that each edge in the graph has a weight associated with it. The algorithm works by finding the shortest path from the starting node to all other nodes in t..
2024.01.30 -
3.5 Graph - 3.5.3 Bellman Ford’s Algorithm
CS - 3. Common Algorithms - 3.5 Graph - 3.5.3 Bellman Ford’s Algorithm Bellman Ford’s Algorithm 💡Bellman ford’s algorithm is a graph algorithm that finds the shortest path from a source vertex to all other vertices in a graph. It is a dynamic programming algorithm that uses a bottom-up approach to find the shortest path. It is similar to Dijkstra’s algorithm but it can handle negative weights. I..
2024.01.29 -
3.5 Graph - 3.5.2 Depth First Search(DFS)
CS - 3. Common Algorithms - 3.5 Graph - 3.5.2 Depth First Search(DFS) Depth First Search 💡Depth first search is a graph traversal algorithm that starts at a root node and explores as far as possible along each branch before backtracking. 깊이 우선 검색은 루트 노드에서 시작하여 각 분기를 따라 가능한 한 멀리 탐색한 후 역추적하는 그래프 탐색 알고리즘입니다. 먼저, 깊이 우선 탐색(Depth First Search, DFS)에 대해 설명드리겠습니다. DFS는 루트 노드(혹은 다른 임의의 노드)에서 시작해서 다음 분기(b..
2024.01.29 -
3.5 Graph - 3.5.1 Breadth First Search(BFS)
CS - 3. Common Algorithms - 3.5 Graph - 3.5.1 Breadth First Search(BFS) Breadth First Search 💡Breadth first search for a graph is a way to traverse the graph. It starts at the root node and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level. 넓이 우선 탐색은 그래프를 탐색하는 방법입니다. 루트 노드에서 시작하여 다음 심도 수준의 노드로 이동하기 전에 현재 심도에 있는 모든 이웃 노드를 탐색합니다. 알고리즘 문..
2024.01.28