A route planner using the A* algorithm (uses Open Street Map data)

cpp17 implementation of A* Search Algorithm for finding the shortest path between two nodes on OpenStreetMap data

Makes use of the C++ IO2D library to render a 2D model of a map showing the shortest path between two nodes determined using the A-Star path finding algorithm

A route planner built in C++ that uses OpenStreetMap data, A* search and the IO2D visualization library to find a path between two points on a real-world map.

Implementation of A* algorithm : Udacity C++ Nanodegree Course project

Using real map data and A* search to find a path between two points - implemented using C++17

Udacity C++ Nanodegree Program- Build an OpenStreetMap Route Planner

This repo contains my code for the Route Planning project in Course 1 of the Udacity C++ Nanodegree. I used C++ Fundamentals along with the A* Search algorithm to implement a simple little path plotting program on top of starter code provided by Udacity that handled rendering.

This is the repo for Route Planning project in which we find a route planner that plots a path between two points on a map using real map data from the OpenStreeMap project using 2D graphics library IO2D and A* Search Algorithm.

Simple app for Autonomous Systems (Cars/Robots) Route/Path Planning.

This is a tool for route planning with OpenStreetMap. To use it, you need to provide an OpenStreetMap XML (*.osm) and specify the start and end point. The program then calculates the shortest path using Dijkstra's algorithm and visualizes the result.

A* plans a path using OpenStreetMap data and display it using IO2D library.