A collection of graph search algorithms including Dijkstra's shortest path algorithm, Multi-Threaded Dijkstra's (MTD) for solving median problem, and a clustering heuristic for p-median problem in Python.