https://github.com/tbtiberiu/luxembourgviewer
Interactive Luxembourg Map Viewer and Shortest Path Calculator Using Dijkstra's Algorithm.
https://github.com/tbtiberiu/luxembourgviewer
dijkstra-algorithm graph-visualization qt-cpp
Last synced: about 2 months ago
JSON representation
Interactive Luxembourg Map Viewer and Shortest Path Calculator Using Dijkstra's Algorithm.
- Host: GitHub
- URL: https://github.com/tbtiberiu/luxembourgviewer
- Owner: tbtiberiu
- Created: 2022-12-18T11:58:50.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-08-11T13:46:35.000Z (almost 2 years ago)
- Last Synced: 2025-01-01T18:20:54.097Z (over 1 year ago)
- Topics: dijkstra-algorithm, graph-visualization, qt-cpp
- Language: C++
- Homepage:
- Size: 8.05 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# LuxembourgViewer
**LuxembourgViewer** is a C++ project using the Qt framework for calculating the shortest path between two nodes on a map using Dijkstra's algorithm. The program reads an XML file containing nodes and edges, displays the graph on the screen, and allows the user to select the start and end nodes interactively. The shortest path is then calculated and displayed on the map.
[Video Presentation](presentation.mp4)
## Prerequisites
- **Qt Framework (MSVC 64-bit compiler)**
- **Visual Studio**
- **Qt Visual Studio Tools Extension**
## Installation
### 1. Install Qt Framework
1. Download and install the [Qt Framework](https://www.qt.io/download).
2. During installation, ensure you select the **MSVC 2019 64-bit** compiler.
### 2. Install Visual Studio
1. Download and install [Visual Studio](https://visualstudio.microsoft.com/).
2. Ensure that the **Desktop development with C++** workload is selected during installation.
### 3. Install Qt Visual Studio Tools Extension
1. Open Visual Studio.
2. Navigate to **Extensions** > **Manage Extensions**.
3. Search for "Qt Visual Studio Tools" and install it.
4. Restart Visual Studio to apply the changes.
## Usage
1. Clone the LuxembourgViewer repository to your local machine:
```bash
git clone https://github.com/tbtiberiu/LuxembourgViewer.git
```
2. Open Visual Studio and go to File > New > Project From Existing Code.
3. Select Visual C++ as the project type and follow the wizard to import the LuxembourgViewer project.
4. Run the application within Visual Studio (`CTRL` + `F5` on Windows)
5. Left Click on the map to select the starting node (red dot). Right Click on the map to select the ending node (blue dot). The program will calculate and display the shortest path using Dijkstra's algorithm.
