This project implements graph algorithms for smart city task scheduling, including Strongly Connected Components detection, Topological Sorting, and Shortest/Longest Path finding in Directed Acyclic Graphs.
Strongly Connected Components using Tarjan's algorithm
Condensation Graph construction from SCCs
Topological Sorting using Kahn's algorithm
Shortest/Longest Paths in DAGs using dynamic programming
Critical Path analysis for task scheduling
Performance Metrics tracking for algorithm analysis
Tarjan's SCC Algorithm: O(V + E) time complexity
Kahn's Topological Sort: O(V + E) time complexity
DAG Shortest Path: O(V + E) time complexity