CS - Roadmap.sh(71)
-
Data structures (with python) - 2. Graph - 2.4. Graph Representation
Data structures (with python) - 2. Graph - 2.4. Graph Representation 💡 A graph can either be represented as an adjacency matrix or an adjacency list. The adjacency matrix is a 2D array of size V x V where V is the number of vertices in a graph. Let the 2D array be adj[][], a slot adj[i][j] = 1 indicates that there is an edge from vertex i to vertex j. Adjacency list is an array of vectors. Size ..
2024.01.04 -
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 -
Data structures (with python) - 2. Graph - 2.2. Undirected graph
Data structures (with python) - 2. Graph - 2.2. Undirected graph 💡 An undirected graph is graph, i.e., a set of objects (called vertices or nodes) that are connected together, where all the edges are bidirectional. An undirected graph is sometimes called an undirected network. In contrast, a graph where the edges point in a direction is called a directed graph. 방향성 없는 그래프는 그래프, 즉 모든 가장자리가 양방향인 객..
2024.01.02 -
Data structures (with python) - 2. Graph - 2.1. Directed graph
Data structures (with python) - 2. Graph - 2.1. Directed graph 💡 A directed graph is graph, i.e., a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another. A directed graph is sometimes called a digraph or a directed network. In contrast, a graph where the edges are bidirectional is called an undirected graph. 방향성 그래프는 서..
2024.01.01 -
Data structures (with python) - 1. Array
Data structures (with python) 1. Array 💡 Arrays store elements in contiguous memory locations, resulting in easily calculable addresses for the elements stored and this allows faster access to an element at a specific index. 배열은 인접한 메모리 위치에 요소를 저장하므로 저장된 요소의 주소를 쉽게 계산할 수 있어 특정 인덱스의 요소에 더 빠르게 액세스할 수 있습니다. Array - 인덱스 존재 - 데이터 위치에 직접적인 접근 가능 - 할당된 공간은 연속적임 -> 조회가 빠르고,cache hit 가능성이 높음 - 미리 배열의 크기를..
2024.01.01