DFS와 BFS, 그리고 Preorder / Inorder / Postorder의 진짜 관계
Jan 6 · 4 min read · 트리나 그래프를 공부하다 보면 항상 함께 등장하는 개념이 있다. DFS / BFS Preorder / Inorder / Postorder 이 둘은 자주 묶여 설명되지만, 실제로는 역할과 레벨이 다르다.이번 글에서는 다음 질문들에 답하는 흐름으로 정리해본다. DFS는 왜 순회 방식이 3가지로 나뉘는가? 순회 코드는 같은데 visit 위치만 다른 건가? BFS에는 왜 preorder / postorder 같은 개념이 없는가? 실무에서...
Join discussionBreadth First Search (BFS): for Undirected Unweighted Graph
Jan 6 · 6 min read · BFS Traversal — 4 Easy Rules Rule 1 — Start Put the starting vertex into a queue. Keep an empty visited set. Rule 2 — Take from Queue While the queue is not empty: Remove the front vertex from the queue. ⚠️ Key difference from BFSBFS → Queu...
Join discussionThe GenAI Revolution: How LLMs Are Transforming Modern Finance
Nov 27, 2025 · 10 min read · The financial services industry is experiencing a seismic shift. Generative AI and Large Language Models aren't just another tech trend—they're fundamentally reimagining how financial professionals work, analyze data, and serve clients. If you're enr...
Join discussionSPARK Matrix™: Behavioral Biometrics and Device Intelligence Solutions
Nov 17, 2025 · 2 min read · The market research on Behavioural Biometrics and Device Intelligence Solutions provides a comprehensive analysis of the global landscape, highlighting emerging technologies, evolving market trends, and future growth opportunities. This study deliver...
Join discussion
SPARK Matrix™: Current Expected Credit Loss (CECL)
Oct 8, 2025 · 2 min read · QKS Group’s market research on Current Expected Credit Loss (CECL) provides a comprehensive global analysis, examining both short-term and long-term market growth opportunities, evolving trends, and future market dynamics. The study offers a detailed...
Join discussion
Shortest Path in Undirected Graph
Sep 7, 2025 · 4 min read · Problem You are given an adjacency list, adj of Undirected Graph having unit weight of the edges, find the shortest path from src to all the vertex and if it is unreachable to reach any vertex, then return -1 for that vertex. Examples : Input: adj[][...
Join discussionShortest path in Directed Acyclic Graph
Sep 7, 2025 · 3 min read · Problem Given a Directed Acyclic Graph of V vertices from 0 to n-1 and a 2D Integer array(or vector) edges[ ][ ] of length E, where there is a directed edge from edge[i][0] to edge[i][1] with a distance of edge[i][2] for all i. (Geeks) Find the short...
Join discussionCourse Schedule 1
Aug 24, 2025 · 2 min read · Problem There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i] = [ai, bi] indicates that you must take course bi first if you want to take course ai. For...
Join discussionBreath First Search (BFS) in Python
Aug 22, 2025 · 3 min read · The Graph → The Python code to find the shortest path in the above ⬆️ graph → from collections import deque from typing import List, Tuple, Optional def bfs(n: int, graph: List[List[int]], source: int) -> Tuple[List[float], List[int]]: """ ...
Join discussion