Skip to content

Calculates the optimal path for traveling between galaxies given a limited amount of distance that can be traveled before a refuel stop is needed

Notifications You must be signed in to change notification settings

Tyler-Hilbert/SpaceTripPlanner

Repository files navigation

Calculates the optimal path of galaxies to stop at while travleing across the universe using parallel BFS on CUDA.

EdgeCreator.py uses RA, DEC and light years from Earth to compute a graph of galaxies that can be travelled between.
An example dataset generated in python:

ParallelBFS.cu performs a BFS in parallel in CUDA to find the best path between 2 given galaxies.

These results are compared to a sequential BFS algorithm.

The report can be found here.

(Random blog post that uses this project)

About

Calculates the optimal path for traveling between galaxies given a limited amount of distance that can be traveled before a refuel stop is needed

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published