An Evaluation Of Shortcutting Strategies For Parallel Bellman-Ford And Other Parallel Single-Source Shortest Path Algorithms