Tag
数据结构
3 public posts share this topic.
Shortest Paths with BFS: 408 Reasoning and Implementation
A step-by-step single-source shortest-path walkthrough for an unweighted graph using BFS, distance, predecessor, visited, and queue state.
Minimum Spanning Trees: Prim and Kruskal for the 408 Exam
A visual explanation of minimum spanning trees, Prim's vertex-growing method, and Kruskal's edge-sorting method with disjoint sets.
KMP Explained: Computing next and nextval Arrays
A 408-oriented explanation of KMP string matching, the one-based next-array convention, and the nextval optimization that skips redundant comparisons.