graph(3)
-
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.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 -
Data structures (with python) - 2. Graph - 2.3. Spanning Tree
Data structures (with python) - 2. Graph - 2.3. Spanning Tree Spanning Tree 💡 A spanning tree is a subset of Graph G, which has all the vertices covered with minimum possible number of edges. Hence, a spanning tree does not have cycles and it cannot be disconnected.. 스패닝 트리는 그래프 G의 하위 집합으로, 모든 정점이 가능한 최소 수의 에지로 덮여 있습니다. 따라서 스패닝 트리에는 주기가 없으며 연결이 끊어질 수 없습니다. Spanning Tree 는 뒤에 Tree 라고 붙지만 구지 분류하자면..
2024.01.03