Channi Studies

Breadth-First SearchAn algorithm commonlyu must visit every vertex in a graph in some order, known as a graph traversal.A breadth-first search (BFS) is a traversal that visits a starting vertex, then all vertices of distance 1 from that vertex, then of distance 2, and so on, without revisiting a vertex. Since the visiting order of same-distance vertices doesn't matter, there can be multiple gra..

GraphsA graph is a data structure for representing connections among items, and consists of vertices connected by edges.- A vertex (or node) represents an item in a graph.- An edge represents a connection between two vertices in a graph. In a graph, - Two vertices are adjacent if connected by an edge.- A path is a sequence of edges leading form a source vertex to a destination vertex. The path..

이 포스트는 모범 답안이 아닙니다. 저의 개인 공부와 사고의 흐름을 담고 있습니다. 접근(a) F_B / l = ?Current = Charge / Time 에서 시작합니다. I = Q / t * (l / l) 여기서 l은 v 방향으로 변화한 길이를 말합니다. Q/l = λ (charge density, given) and Q/t = v (velocity, given) I1과 I2를 알았으니, 공식에 대입하면 됩니다. 여기서 r = d: 두 와이어 사이의 거리 입니다. Attractive Force 인 이유는 다음과 같습니다. F = v ⨯ B (Megnetic Force = velocity vector crossed with magnetic field) v의 방향이 I의 방향이라고 보면 되기..

Implementing a Set with a BSTA set can be implemented in Python using a Binary Search Table (BST) to store set elements. In practice, a balanced BST or hash table is often used to efficiently implement a set, but a BST will suffice for all necessary set opeartions. Each node's data stores a set element. References to left child, right child, and parent nodes are also included. External functiona..