DSA Solution
✕
Note Preview
04_dsa_solutions/leetcode_solutions
📖 Open Note
TOC
Sidebar
Graph
Focus
Tools
Top
Table of Contents
✕
Exit Focus Mode
Platform & Reading Settings
✕
Theme & Appearance
COLOR THEME
☀️ Light
🌙 Dark
READING TINT
Default
📜 Paper
🌅 Warm
Reading & View Controls
📖
Distraction-Free Focus
Toggle
🗺️
Obsidian Global Graph
Graph
📑
Platform Specs & Audit
Report
🧹
Reset Local Storage & Cache
Reset
📑 Platform Audit & Verification Report
✕
360
Indexed Notes
5.0s
Build Time
100%
SPA Compliant
60 FPS
PixiJS Graph
Active Platform Features
✅
Multi-Track Fast Dev
: Staging 2+ tracks in parallel with sub-5s full builds.
✅
Obsidian Graph Engine
: Emerald (DSA), Indigo (Architecture), Amber (Languages), Pink (Cloud).
✅
Directed Arrows
: GPU-accelerated triangular vectors indicating knowledge dependencies.
✅
Lazy-Loaded Graph
: Zero initial memory/CDN overhead, hydrating strictly on viewport intersection.
✅
Mobile TOC Drawer
: Touch-friendly bottom sheet highlighting active section headings.
✅
Distraction-Free Focus
: Maximize reading canvas with 1-click floating exit trigger.
✅
Resilient Storage
: Defensive JSON parsing preventing crashes across hard reload (Ctrl+Shift+R).
GraphMind
Dark mode
Light mode
Explorer
dijkstra
Search
Search
2 items with this tag.
Oct 27, 2026
Shortest Path Algorithms: Comprehensive Master Guide — Tổng Quan Thuật Toán Đường Đi Ngắn Nhất
dsa
graphs
shortest-path
bfs
0-1-bfs
dijkstra
bellman-ford
floyd-warshall
johnsons-algorithm
a-star
spfa
relaxation
algorithms
computer-science
learning-note
Oct 27, 2026
01. Advanced DSA Pattern: Minimum Cost Maximum Flow (MCMF) - Successive Shortest Path
dsa
graph-theory
network-flow
min-cost-max-flow
mcmf
successive-shortest-path
spfa
dijkstra
advanced-patterns
competitive-programming
algorithms
computer-science
learning-note