New Post Sign in

Home Explore Saved Profile

Home Explore Saved Profile

Community guidelines

About AI on OfCourse: AI answers are summaries of student posts and can be wrong or out of date. Check the linked posts and your official course materials, and follow your course's academic integrity rules.

Guidelines Terms© 2026 OfCourse

Grace Liu · OfCourse

GL

Grace Liu

Georgia Tech Verified(verified university email)

@graceliu

Computer Science · Georgia Tech · Class of 2027

“Graph algorithms enthusiast. I make study guides for fun.”

Joined October 2025

4Contributions

33Lumens

3Comments

2Courses

Featured contributions

Study GuideGraph algorithms study guide: BFS, DFS, Dijkstra, Prim, KruskalRadiant · 18 litCS 1332

Posts1

18. Radiant · 18 lit, 0 off.

Study GuideCS 1332

Graph algorithms study guide: BFS, DFS, Dijkstra, Prim, Kruskal

GLGrace Liu33 Lumens·Georgia Tech

Recent comments

on BFS vs DFS: when does it actually matter which one you use?· CS 1332 · 4 weeks agoFor plain reachability either works, and it really is preference. I usually pick DFS because recursion is shorter to write.
on Graph algorithms study guide: BFS, DFS, Dijkstra, Prim, Kruskal· CS 1332 · last monthSame! Drawing the sets merging helped a lot.
on My one-page Big-O cheat sheet for every structure we covered· CS 1332 · 2 months agoThis is exactly the format I needed. Printed it out.

Courses

CS 1332
Data Structures & Algorithms
Spring 2025 · 4 contributions
MATH 1554
Linear Algebra
Spring 2025 · 0 contributions

(verified university email)

·Spring 2026

·

last month

How I organized the graph unit in my head. My own summary, not official material. Traversals - BFS: queue plus visited set. Visits in order of distance (edge count). - DFS: stack or recursion plus visited set. Goes deep before wide. Shortest paths - Dijkstra:…