You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Using Topological Sort, Shortest Path, and Regex, we tackle the second part of the smart city challenge. The first task includes using DP or Topological Sort to find an optimal schedule for the tasks. The second includes using optimal path, or Dijkstra's to find optimal paths to get around the city using walking or a train system.