Graph Algorithms and Routing Questions

Model spatial and network problems as graphs and apply algorithmic techniques used in routing, batching, and location optimization. Expect to reason about shortest path algorithms such as Dijkstra and A Star, breadth first search and depth first search, union find for connectivity, minimum spanning trees, and flow algorithms for capacity constrained routing. Discuss complexity analysis, data structures for efficient graph traversal, heuristics and approximations for vehicle routing and order batching, time window and capacity constraints, and approaches to handle dynamic updates and large scale graphs in streaming or incremental environments.