FIT2004 Complete W4-6 Notes
Subject notes for Monash FIT2004
Description
Complete Notes Week 4-6 Introduction to graphs Graph traversal algorithms Breadth-First Search (BFS) Depth-First Search (DFS) Applications of BFS and DFS Greedy algorithms Dijkstra’s algorithm for shortest paths Prim’s algorithm for minimum spanning trees Kruskal's algorithm for minimum spanning trees Dynamic Programming Knapsack problem Edit distance problem
Monash
Semester 1, 2026
11 pages
2,976 words
$54.00
Campus
Monash, Clayton
Member since
April 2026