Data Analysis and Algorithms – Graph Algorithms & Computational Complexity
This document explores essential graph algorithms and the fundamentals of computational complexity. Topics include depth-first search (DFS), breadth-first search (BFS), Dijkstra's and Kruskal's algorithms, along with complexity classes such as P, NP, and NP-complete. It is designed for students studying computer science or data analysis, especially those preparing for exams or tackling advanced algorithm challenges.
Written for
- Institution
- DTC
- Course
- DAA
Document information
- Uploaded on
- July 4, 2025
- Number of pages
- 20
- Written in
- 2024/2025
- Type
- Class notes
- Professor(s)
- *
- Contains
- All classes
Subjects
-
graph algorithms
-
dfs
-
bfs
-
dijkstras algorithm
-
kruskals algorithm
Also available in package deal