Trailblazer

About

Trailblazer displays various road maps and allows users to find the shortest path between any two nodes. If the user clicks on any two nodes in the world, the program will find a path from the starting position to the ending position. As it does so, it will color the vertexes green and yellow based on the colors assigned to them by the algorithm. Once the path is found, the program will highlight it and display information about the path cost in the console. The user can select one of four path-searching algorithms in the top menu:

  • Breadth-first search (BFS)
  • Dijkstra's algorithm
  • A* search
  • Alternative Route

Technologies & Concepts

  • C++
  • Graph Search
    • Breadth Search First
    • Dijkstra
    • A* with heuristic design
    • Alternative Route Algorithm