We introduce UNIversal CORridor network simulator (UNICOR), a species connectivity and corridor identifi cation tool. UNICOR applies Dijkstra's shortest path algorithm to individual-based simulations. Outputs can be used to designate movement corridors, identify isolated populations, and prioritize conservation plans to promote species persistence. The key features include a driver-module framework, connectivity mapping with thresholding and buffering, and calculation of graph theory metrics. Through parallel-processing, computational efficiency is greatly improved, allowing analyses of large extents and entire populations. Previously available approaches are limited by prolonged computational times and poor algorithmic efficiency, restricting problem-size and requiring artificial subsampling of populations.