Problem Generators and Code for the Paper "Methods for Finding Paths of a Prescribed Length in Weighted Graphs"

The code for generating random or planar graphs is contained in graphGeneration.py, while the code for downloading real-world street networks is provided in downloadNetwork.py. Implementations for removing redundant nodes and smoothing intermediate nodes are found in reductionTechniques.py, whereas the shortest-path removal technique and the methods for finding an s-t path of a prescribed length are implemented in heuristicMethods.cpp. Instructions for executing these programs from the command line are provided in UserGuideKPP.pdf.